[LeetCode] 55 Jump Game

1 2 3 4 5 6 7 8 9 10 11 12 13

class Solution { public: bool canJump(vector<int>& nums) { int N = nums.size(); int maxJump = 0; for (int i = 0; i < N; i++) { if (maxJump < i) break; maxJump = max(maxJump, i + nums[i]); } return maxJump >= N - 1; } };