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.1 KiB
1.1 KiB
TODO 0055. Jump Game medium
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return ~true~/ if you can reach the last index, or false otherwise/.
Example 1:
Input: nums = [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.Example 2:
Input: nums = [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.Constraints:
1 <= nums.length <= 10^{4}0 <= nums[i] <= 10^{5}
TODO Approach
Write your approach here.
TODO Python
class Solution:
def canJump(self, nums: List[int]) -> bool:TODO C++
class Solution {
public:
bool canJump(vector<int>& nums) {
}
};