LeetCode——055

/*
55. Jump Game My Submissions QuestionEditorial Solution
Total Accepted: 76258 Total Submissions: 270540 Difficulty: Medium
Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine if you are able to reach the last index.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

Subscribe to see which companies asked this question

Show Tags

*/

/*
解题思路：

*/

class Solution {
public:
    bool canJump(vector<int>& nums) {

     /*
     //动态规划
     int n=nums.size();
      vector<int> dp(n,0);
      for(int i=1;i<n;++i){
          dp[i]=max(dp[i-1],nums[i-1])-1;
          if(dp[i]<0)return false;
      }

      return dp[n-1]>=0;*/

      //追及问题
      int maxIdx=0;
      for(int i=0;i<nums.size();++i){
          if(i>maxIdx ||maxIdx>=nums.size()-1)break;
          maxIdx=max(maxIdx,i+nums[i]);
      }
      return maxIdx>=nums.size()-1;
    }
};