leetcode

0 class Solution {

1 public:

2 bool canJump(vector<int> &nums) {

3 int n = nums.size(), limit = 0;

4 for (int i = 0; i <= limit && i < n; i++)

5 limit = max(limit, i + nums[i]);

6 return limit >= n - 1;

7 }

8 };