tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.3 KiB
1.3 KiB
TODO 0045. Jump Game II medium
You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at index i, you can jump to any index (i + j) where:
0 <= j <= nums[i]andi + j < n
Return /the minimum number of jumps to reach index /~n - 1~. The test cases are generated such that you can reach index n - 1.
Example 1:
Input: nums = [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.Example 2:
Input: nums = [2,3,0,1,4]
Output: 2Constraints:
1 <= nums.length <= 10^{4}0 <= nums[i] <= 1000- It's guaranteed that you can reach
nums[n - 1].
TODO Approach
Write your approach here.
TODO Python
class Solution:
def jump(self, nums: List[int]) -> int:TODO C++
class Solution {
public:
int jump(vector<int>& nums) {
}
};