add 1860

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java) ||Medium|Math|
 |1859|[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1859.java) ||Easy|String, Sort|
 |1854|[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1854.java) ||Easy|Array|
 |1848|[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1848.java) ||Easy|Array|

src/main/java/com/fishercoder/solutions/_1860.java

@@ -0,0 +1,18 @@
+package com.fishercoder.solutions;
+
+public class _1860 {
+    public static class Solution1 {
+        public int[] memLeak(int memory1, int memory2) {
+            int time = 1;
+            while (memory1 >= time || memory2 >= time) {
+                if (memory1 >= memory2) {
+                    memory1 -= time;
+                } else {
+                    memory2 -= time;
+                }
+                time++;
+            }
+            return new int[]{time, memory1, memory2};
+        }
+    }
+}