【LeetCode】55. Jump Game (Medium)
2016-11-06 20:42
519 查看
【题目】
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 =
A =
【解】所有不大于maximum jump length的距离都可以跳,所以只要看能够跳到的最大距离是不是比最后一个远。
class Solution {
public:
bool canJump(vector<int>& nums) {
int n = nums.size();
if (n == 0) return false;
int m = nums[0];
for (int i = 1; i < n; i++) {
if (m < i) return false;//跳不到位置i,可以确定不能跳到最后
if (i + nums[i] > m)//从位置i可以比从之前的位置跳得更远
m = i + nums[i];
}
return true;
}
};
时间复杂度O(n),空间复杂度O(1)
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.
【解】所有不大于maximum jump length的距离都可以跳,所以只要看能够跳到的最大距离是不是比最后一个远。
class Solution {
public:
bool canJump(vector<int>& nums) {
int n = nums.size();
if (n == 0) return false;
int m = nums[0];
for (int i = 1; i < n; i++) {
if (m < i) return false;//跳不到位置i,可以确定不能跳到最后
if (i + nums[i] > m)//从位置i可以比从之前的位置跳得更远
m = i + nums[i];
}
return true;
}
};
时间复杂度O(n),空间复杂度O(1)
相关文章推荐
- 【LeetCode】55.Jump Game(Medium)解题报告
- LeetCode解题报告 55. Jump Game [medium]
- Leetcode 55. Jump Game (Medium) (java)
- [array] leetcode-55. Jump Game - Medium
- [leetcode]55. Jump Game ,C++/PYTHON实现,medium难度
- Leetcode 55. Jump Game (Medium) (cpp)
- LeetCode 55. Jump Game|贪心算法
- 55. Jump Game (leetcode)
- [leetcode 55. Jump Game]week 7
- [leetcode] 55. Jump Game 解题报告
- [LeetCode] 55. Jump Game
- 【LeetCode】(55)Jump Game(Medium)
- LeetCode 55. Jump Game(跳跃游戏Ⅰ)
- 55. Jump Game - Medium
- 55. Jump Game 类别:贪心算法 难度:medium
- [Leetcode 55, Medium] Jump Game
- LeetCode 55. Jump Game 解题报告
- LeetCode 55. Jump Game (跳跃游戏)
- LeetCode--------55. Jump Game(数组中的数字跳跃)
- [LeetCode] 55. Jump Game 解题思路