首页 > 其他 > 详细

Leetcode 1518 换酒问题

时间:2021-05-10 00:33:27      阅读:18      评论:0      收藏:0      [点我收藏+]

技术分享图片 

  JAVA:

public final int numWaterBottles(int numBottles, int numExchange) {
        int re = numBottles, empty = numBottles;
        while (empty >= numExchange) {
            int newBeer = empty / numExchange;
            re += newBeer;
            empty = empty % numExchange + newBeer;
        }
        return re;
    }

  JS:

/**
 * @param {number} numBottles
 * @param {number} numExchange
 * @return {number}
 */
var numWaterBottles = function (numBottles, numExchange) {
    let re = numBottles, empty = numBottles;
    while (empty >= numExchange) {
        let newBeer = Math.floor(empty / numExchange);
        re += newBeer;
        empty = empty % numExchange + newBeer;
    }
    return re;
};

技术分享图片

 

Leetcode 1518 换酒问题

原文:https://www.cnblogs.com/niuyourou/p/14749106.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!