Add solution #1518

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,342 LeetCode solutions in JavaScript
+# 1,343 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1159,6 +1159,7 @@
 1513|[Number of Substrings With Only 1s](./solutions/1513-number-of-substrings-with-only-1s.js)|Medium|
 1514|[Path with Maximum Probability](./solutions/1514-path-with-maximum-probability.js)|Medium|
 1515|[Best Position for a Service Centre](./solutions/1515-best-position-for-a-service-centre.js)|Hard|
+1518|[Water Bottles](./solutions/1518-water-bottles.js)|Easy|
 1519|[Number of Nodes in the Sub-Tree With the Same Label](./solutions/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.js)|Medium|
 1524|[Number of Sub-arrays With Odd Sum](./solutions/1524-number-of-sub-arrays-with-odd-sum.js)|Medium|
 1528|[Shuffle String](./solutions/1528-shuffle-string.js)|Easy|

solutions/1518-water-bottles.js

@@ -0,0 +1,31 @@
+/**
+ * 1518. Water Bottles
+ * https://leetcode.com/problems/water-bottles/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number} numBottles
+ * @param {number} numExchange
+ * @return {number}
+ */
+var numWaterBottles = function(numBottles, numExchange) {
+  let result = numBottles;
+  let emptyBottles = numBottles;
+
+  while (emptyBottles >= numExchange) {
+    const newBottles = Math.floor(emptyBottles / numExchange);
+    result += newBottles;
+    emptyBottles = newBottles + (emptyBottles % numExchange);
+  }
+
+  return result;
+};