New Problem Solution - "1860. Incremental Memory Leak"

Author: haoel

Diff for: README.md

@@ -9,6 +9,7 @@ LeetCode
 
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/) | [C++](./algorithms/cpp/incrementalMemoryLeak/IncrementalMemoryLeak.cpp)|Medium|
 |1859|[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/) | [C++](./algorithms/cpp/sortingTheSentence/SortingTheSentence.cpp)|Easy|
 |1857|[Largest Color Value in a Directed Graph](https://leetcode.com/problems/largest-color-value-in-a-directed-graph/) | [C++](./algorithms/cpp/largestColorValueInADirectedGraph/LargestColorValueInADirectedGraph.cpp)|Hard|
 |1856|[Maximum Subarray Min-Product](https://leetcode.com/problems/maximum-subarray-min-product/) | [C++](./algorithms/cpp/maximumSubarrayMinProduct/MaximumSubarrayMinProduct.cpp)|Medium|

Diff for: algorithms/cpp/incrementalMemoryLeak/IncrementalMemoryLeak.cpp

@@ -0,0 +1,64 @@
+// Source : https://leetcode.com/problems/incremental-memory-leak/
+// Author : Hao Chen
+// Date   : 2021-05-22
+
+/***************************************************************************************************** 
+ *
+ * You are given two integers memory1 and memory2 representing the available memory in bits on two 
+ * memory sticks. There is currently a faulty program running that consumes an increasing amount of 
+ * memory every second.
+ * 
+ * At the i^th second (starting from 1), i bits of memory are allocated to the stick with more 
+ * available memory (or from the first memory stick if both have the same available memory). If 
+ * neither stick has at least i bits of available memory, the program crashes.
+ * 
+ * Return an array containing [crashTime, memory1crash, memory2crash], where crashTime is the time (in 
+ * seconds) when the program crashed and memory1crash and memory2crash are the available bits of 
+ * memory in the first and second sticks respectively.
+ * 
+ * Example 1:
+ * 
+ * Input: memory1 = 2, memory2 = 2
+ * Output: [3,1,0]
+ * Explanation: The memory is allocated as follows:
+ * - At the 1^st second, 1 bit of memory is allocated to stick 1. The first stick now has 1 bit of 
+ * available memory.
+ * - At the 2^nd second, 2 bits of memory are allocated to stick 2. The second stick now has 0 bits of 
+ * available memory.
+ * - At the 3^rd second, the program crashes. The sticks have 1 and 0 bits available respectively.
+ * 
+ * Example 2:
+ * 
+ * Input: memory1 = 8, memory2 = 11
+ * Output: [6,0,4]
+ * Explanation: The memory is allocated as follows:
+ * - At the 1^st second, 1 bit of memory is allocated to stick 2. The second stick now has 10 bit of 
+ * available memory.
+ * - At the 2^nd second, 2 bits of memory are allocated to stick 2. The second stick now has 8 bits of 
+ * available memory.
+ * - At the 3^rd second, 3 bits of memory are allocated to stick 1. The first stick now has 5 bits of 
+ * available memory.
+ * - At the 4^th second, 4 bits of memory are allocated to stick 2. The second stick now has 4 bits of 
+ * available memory.
+ * - At the 5^th second, 5 bits of memory are allocated to stick 1. The first stick now has 0 bits of 
+ * available memory.
+ * - At the 6^th second, the program crashes. The sticks have 0 and 4 bits available respectively.
+ * 
+ * Constraints:
+ * 
+ * 	0 <= memory1, memory2 <= 2^31 - 1
+ ******************************************************************************************************/
+
+class Solution {
+public:
+    vector<int> memLeak(int memory1, int memory2) {
+        int i=0;
+        while(++i) {
+            int& himem = memory1 >= memory2 ? memory1 : memory2;
+            if (himem < i) break;
+            himem -= i;
+        }
+        vector<int> result={i, memory1, memory2};
+        return result;
+    }
+};