LeetCode 55. Jump Game
2017-06-07 20:38
435 查看
题意
给出n个点和当前点能前进的最长距离，问能否从第一个点到达最后一个点思路
从最后开始便利，将loc点看做目标点，如果遍历的点能够到达，那么更新目标点为遍历点，因为在前面只需要到达目标点即可到达最后.代码
class Solution {
public:
bool canJump(vector<int>& nums) {
size_t len = nums.size();
int loc = len - 1;
for(int i = len - 2; i >= 0; i--){
if(i + nums[i] >= loc){
loc = i;
}
}
return loc == 0;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 55. Jump Game
- LeetCode 55. Jump Game
- LeetCode 55. Jump Game
- leetcode 55. Jump Game
- 第五周：[Leetcode]55. Jump Game
- leetcode 55. Jump Game
- Leetcode-55. Jump Game
- Leetcode题解 - 55. Jump Game
- Leetcode:55. Jump Game
- Jump Game 的三种思路 - leetcode 55. Jump Game
- Leetcode 55. Jump Game
- LeetCode 55. Jump Game
- LEETCODE 55. Jump Game
- leetcode: 55. Jump Game
- Leetcode题解：55. Jump Game
- Leetcode 55. Jump Game
- Leetcode 55. Jump Game
- leetcode 55. Jump Game
- 【leetcode】55. Jump Game
- leetcode 55. Jump Game