description:

看是否能跳到最后.
Note:

Example:

Example 1:Input: [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.Example 2:Input: [3,2,1,0,4] Output: false Explanation: You will always arrive at index 3 no matter what. Its maximumjump length is 0, which makes it impossible to reach the last index.

answer:

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

relative point get√：

hint :

就是一直維護一個最遠距離

轉載于:https://www.cnblogs.com/forPrometheus-jun/p/11273270.html

總結

以上是生活随笔為你收集整理的55. Jump Game的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。