Cover image for LeetCode Daily Problem P3100 Water Bottles II

LeetCode Daily Problem P3100 Water Bottles II


Timeline

Timeline

2025-10-02

init

Math, Simulation

Problem:

Always drink all the water, and if there is no water, exchange

123456789101112131415161718192021222324
class Solution {public:  int maxBottlesDrunk(int numBottles, int numExchange) {    int full_bottles = numBottles;    int empty_bottles = 0;    int num_exchange = numExchange;    int bottle_drunk = 0;    while (full_bottles > 0 || empty_bottles >= num_exchange) {      // drink      bottle_drunk += full_bottles;      empty_bottles += full_bottles;      full_bottles = 0;      // exchange      while (empty_bottles >= num_exchange) {        empty_bottles -= num_exchange;        num_exchange++;        full_bottles++;      }    }    return bottle_drunk;  }};
Loading comments…