55. Jump Game

题目链接

https://leetcode.com/problems/jump-game/

解题思路

贪心求解。

代码

class Solution {
public:
    bool canJump(vector<int>& nums) {
        if (nums.size() == 0) {
            return false;
        }

        int maxSum = nums[0];
        for (int i = 1; i < nums.size(); i++) {
            if (maxSum < i) {
                return false;
            }

            //保留最大的能跳到的位置
            int sum = i + nums[i];
            if (sum > maxSum) {
                maxSum = sum;
            }
        }
        return true;
    }
};