Leetcode 3100. Water Bottles II

Given initial full bottles and an exchange rule that trades numExchange empty bottles for one full bottle but increments numExchange by 1 after each exchange (so you cannot reuse the same exchange rate), compute the maximum number of bottles you can drink. This is essentially a simulation/greedy problem of repeatedly drinking full bottles, collecting empties, and performing exchanges until no further exchanges are possible.