LeetCode_1518_换酒问题

最新推荐文章于 2024-09-20 15:28:15 发布

Fitz1318

最新推荐文章于 2024-09-20 15:28:15 发布

阅读量252

点赞数

分类专栏： LeetCode学习之路文章标签： leetcode

本文链接：https://blog.csdn.net/Fitz1318/article/details/109411993

版权

LeetCode学习之路专栏收录该内容

307 篇文章 2 订阅

订阅专栏

题目链接

https://leetcode-cn.com/problems/water-bottles/

解题思路

假设一开始有n瓶酒，m个空瓶可以换一瓶酒
首先一定可以喝到n瓶酒，剩下n个空瓶。
然后可以拿瓶子换酒，每次拿出m个瓶子换一瓶酒
然后再喝完这瓶酒，得到一个空瓶
循环下去，直到空瓶换不了酒为止

AC代码

class Solution {
    public int numWaterBottles(int numBottles, int numExchange) {
        int ans = numBottles;
        int bottle = numBottles;
        while (bottle >= numExchange) {
            bottle -= numExchange;
            ans++;
            bottle++;
        }
        return ans;
    }
}

本地测试代码

package com.company;

public class Solution_1518 {
    public static int numWaterBottles(int numBottles, int numExchange) {
        int ans = numBottles;
        int bottle = numBottles;
        while (bottle >= numExchange) {
            bottle -= numExchange;
            ans++;
            bottle++;
        }
        return ans;
    }

    public static void main(String[] args) {
        System.out.println(numWaterBottles(9, 3));
        System.out.println(numWaterBottles(15, 4));
        System.out.println(numWaterBottles(5, 5));
        System.out.println(numWaterBottles(2, 3));
    }
}