[leetcode刷题系列]Jump Game
2013-08-06 17:14
369 查看
也许算是dp把- -
class Solution { public: bool canJump(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int last = n - 1; for(int i = n - 2; i >= 0; -- i){ if(i + A[i] >= last ) last = i; } return last == 0; } };
相关文章推荐
- 【LeetCode】 Jump Game 系列
- [leetcode刷题系列]Recover Binary Search Tree
- LeetCode 55. Jump Game(跳格子)
- LeetCode刷题系列_5题
- leetcode—Spiral Matrix系列
- [leetcode刷题系列]Combination Sum
- 算法系列(12)LeetCode292 Nim Game
- leetcode系列(四):罗马数Roman to Integer
- LeetCode题解系列--718. Maximum Length of Repeated Subarray
- [leetcode]Jump Game
- 【LeetCode】 Pascal's Triangle 系列
- [LeetCode] Jump Game
- LeetCode(55)Jump Game
- [Leetcode刷题总结系列][Dynamic programming]198. House Robber
- [LeetCode]Jump Game
- [LeetCode系列]链表环探测问题II
- 【LeetCode】字符串系列(Anagram)
- Leetcode 之 Jump Game
- [LeetCode] Jump Game
- leetcode: 2Sum/3Sum/3SumClosest/4Sum系列问题