LeetCode(55) Jump Game

相似的题目及其题解报告LeetCode(53) Maximum Subarray

class Solution {public:    bool canJump(vector<int>& nums) {        reverse(nums.begin(), nums.end());        int length = nums.size();        bool *arr = new bool[length];        arr[0] = true;        int firstTrueIndex = 0;        for(int i = 1; i < length; i++) {            if(nums[i] >= (i - firstTrueIndex)) {                arr[i] = true;                firstTrueIndex = i;            }else                arr[i] = false;        }        return arr[length - 1];    }};