Add solution #1705

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,489 LeetCode solutions in JavaScript
+# 1,490 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1314,6 +1314,7 @@
 1702|[Maximum Binary String After Change](./solutions/1702-maximum-binary-string-after-change.js)|Medium|
 1703|[Minimum Adjacent Swaps for K Consecutive Ones](./solutions/1703-minimum-adjacent-swaps-for-k-consecutive-ones.js)|Hard|
 1704|[Determine if String Halves Are Alike](./solutions/1704-determine-if-string-halves-are-alike.js)|Easy|
+1705|[Maximum Number of Eaten Apples](./solutions/1705-maximum-number-of-eaten-apples.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|

solutions/1705-maximum-number-of-eaten-apples.js

@@ -0,0 +1,50 @@
+/**
+ * 1705. Maximum Number of Eaten Apples
+ * https://leetcode.com/problems/maximum-number-of-eaten-apples/
+ * Difficulty: Medium
+ *
+ * There is a special kind of apple tree that grows apples every day for n days. On the ith day,
+ * the tree grows apples[i] apples that will rot after days[i] days, that is on day i + days[i]
+ * the apples will be rotten and cannot be eaten. On some days, the apple tree does not grow any
+ * apples, which are denoted by apples[i] == 0 and days[i] == 0.
+ *
+ * You decided to eat at most one apple a day (to keep the doctors away). Note that you can keep
+ * eating after the first n days.
+ *
+ * Given two integer arrays days and apples of length n, return the maximum number of apples you
+ * can eat.
+ */
+
+/**
+ * @param {number[]} apples
+ * @param {number[]} days
+ * @return {number}
+ */
+var eatenApples = function(apples, days) {
+  const expiryCounts = new Array(40001).fill(0);
+  let result = 0;
+  let earliestExpiry = Infinity;
+  let maxExpiry = apples.length;
+
+  for (let day = 0; day <= maxExpiry; day++) {
+    if (earliestExpiry < day) earliestExpiry = day;
+
+    if (day < apples.length && apples[day]) {
+      const expiry = day + days[day] - 1;
+      expiryCounts[expiry] += apples[day];
+      earliestExpiry = Math.min(expiry, earliestExpiry);
+      maxExpiry = Math.max(expiry, maxExpiry);
+    }
+
+    while (!expiryCounts[earliestExpiry] && earliestExpiry < maxExpiry) {
+      earliestExpiry++;
+    }
+
+    if (expiryCounts[earliestExpiry]) {
+      result++;
+      expiryCounts[earliestExpiry]--;
+    }
+  }
+
+  return result;
+};