There are?numBottles?water bottles that are initially full of water. You can exchange?numExchange?empty water bottles from the market with one full water bottle.

The operation of drinking a full water bottle turns it into an empty bottle.

Given the two integers?numBottles?and?numExchange, return?the?maximum?number of water bottles you can drink.

?

Example 1:

Input:?? numBottles = 9, numExchange = 3

Output: 13

Explanation: You can exchange 3 empty bottles to get 1 full water bottle. Number of water bottles you can drink: 9 + 3 + 1 = 13.

Example 2:

Input: numBottles = 15, numExchange = 4

Output: 19

Explanation: You can exchange 4 empty bottles to get 1 full water bottle. Number of water bottles you can drink: 15 + 3 + 1 = 19.

--------------------------------------------------------

超市正在促銷，你可以用 numExchange 個空水瓶從超市兌換一瓶水。最開始，你一共購入了 numBottles 瓶水。

如果喝掉了水瓶中的水，那么水瓶就會變成空的。

給你兩個整數(shù) numBottles 和 numExchange ，返回你 最多 可以喝到多少瓶水。

下面是代碼：

Runtime:?0 ms, faster than?100.00%?of?Java?online submissions for?Water Bottles.

Memory Usage:?39.3 MB, less than?65.71%?of?Java?online submissions for?Water Bottles.