Add solution #45

JoshCrozier · JoshCrozier · commit 337b0fc65d9a · 2023-01-17T19:48:49.000-06:00
diff --git a/0045-jump-game-ii.js b/0045-jump-game-ii.js
@@ -0,0 +1,37 @@
+/**
+ * 45. Jump Game II
+ * https://leetcode.com/problems/jump-game-ii/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed array of integers nums of length n.
+ * You are initially positioned at nums[0].
+ *
+ * Each element nums[i] represents the maximum length of a forward
+ * jump from index i. In other words, if you are at nums[i], you
+ * can jump to any nums[i + j] where:
+ * - 0 <= j <= nums[i] and
+ * - i + j < n
+ *
+ * Return the minimum number of jumps to reach nums[n - 1].
+ * The test cases are generated such that you can reach nums[n - 1].
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var jump = function(nums) {
+  let result = 0;
+  let max = 0;
+  let previous = 0;
+
+  for (let index = 0; index < nums.length - 1; index++) {
+    max = Math.max(max, index + nums[index]);
+    if (index === previous) {
+      result++;
+      previous = max;
+    }
+  }
+
+  return result;
+};
diff --git a/README.md b/README.md
@@ -48,6 +48,7 @@
 41|[First Missing Positive](./0041-first-missing-positive.js)|Hard|
 42|[Trapping Rain Water](./0042-trapping-rain-water.js)|Hard|
 43|[Multiply Strings](./0043-multiply-strings.js)|Medium|
+45|[Jump Game II](./0045-jump-game-ii.js)|Medium|
 46|[Permutations](./0046-permutations.js)|Medium|
 47|[Permutations II](./0047-permutations-ii.js)|Medium|
 48|[Rotate Image](./0048-rotate-image.js)|Medium|
