add 1705

fishercoder1534 · fishercoder1534 · commit 2a5b4bd1a761 · 2021-03-14T17:08:37.000-07:00
diff --git a/README.md b/README.md
@@ -52,6 +52,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1711|[Count Good Meals](https://leetcode.com/problems/count-good-meals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1711.java) ||Medium|Array, HashTable, Two Pointers|
 |1710|[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1710.java) ||Easy|Greedy, Sort|
 |1708|[Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1708.java) ||Easy|Array, Greedy|
+|1705|[Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1705.java) ||Medium|Heap, Greedy|
 |1704|[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1704.java) ||Easy|String|
 |1700|[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1700.java) ||Easy|Array|
 |1694|[Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1694.java) ||Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1705.java b/src/main/java/com/fishercoder/solutions/_1705.java
@@ -0,0 +1,26 @@
+package com.fishercoder.solutions;
+
+import java.util.PriorityQueue;
+
+public class _1705 {
+    public static class Solution1 {
+        public int eatenApples(int[] apples, int[] days) {
+            /**we sort the heap by its expiration dates, we'll eat the earliest expiration apples first*/
+            PriorityQueue<int[]> minHeap = new PriorityQueue<>((a, b) -> a[0] - b[0]);
+            int eatenApples = 0;
+            for (int i = 0; i < apples.length || !minHeap.isEmpty(); i++) {
+                if (i < apples.length) {
+                    minHeap.offer(new int[]{i + days[i], apples[i]});
+                }
+                while (!minHeap.isEmpty() && (minHeap.peek()[0] <= i || minHeap.peek()[1] <= 0)) {
+                    minHeap.poll();
+                }
+                if (!minHeap.isEmpty()) {
+                    eatenApples++;
+                    minHeap.peek()[1]--;
+                }
+            }
+            return eatenApples;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1705Test.java b/src/test/java/com/fishercoder/_1705Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1705;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1705Test {
+    private static _1705.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1705.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(7, solution1.eatenApples(new int[]{1, 2, 3, 5, 2}, new int[]{3, 2, 1, 4, 2}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(5, solution1.eatenApples(new int[]{3, 0, 0, 0, 0, 2}, new int[]{3, 0, 0, 0, 0, 2}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(5, solution1.eatenApples(new int[]{9, 2}, new int[]{3, 5}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(8, solution1.eatenApples(new int[]{2, 1, 1, 4, 5}, new int[]{10, 10, 6, 4, 2}));
+    }
+
+}
