[LeetCode] 53. Maximum Subarray
2018-02-07 20:48
393 查看
题:https://leetcode.com/problems/jump-game/discuss/20917/Linear-and-simple-solution-in-C++
题目
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 =
思路
只用寻找最大能触及的下边,那就当前下标能到达的最大下标为i+nums[i]。
Code
class Solution {
public:
bool canJump(vector<int>& nums) {
int len = nums.size();
int i = 0;
cout<<len<<endl;
for(int reach = 0;i<len && i<= reach;i++){
reach = max(i+nums[i],reach);
}
return i == len;
}
};
题目
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.
思路
只用寻找最大能触及的下边,那就当前下标能到达的最大下标为i+nums[i]。
Code
class Solution {
public:
bool canJump(vector<int>& nums) {
int len = nums.size();
int i = 0;
cout<<len<<endl;
for(int reach = 0;i<len && i<= reach;i++){
reach = max(i+nums[i],reach);
}
return i == len;
}
};
相关文章推荐
- 【Leetcode】Lee. 53. Maximum Subarray
- [leetcode]53. Maximum Subarray 最大连续子串python实现【medium】
- Leetcode 53. Maximum Subarray
- [leetcode] 53. Maximum Subarray
- leetcode53. Maximum Subarray
- leetcode--53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- leetcode.array--53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- LeetCode - 53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- LeetCode53. Maximum Subarray
- LeetCode [53. Maximum Subarray]
- leetcode 53. Maximum Subarray
- [LeetCode] 53. Maximum Subarray
- [leetcode]#53. Maximum Subarray
- Leetcode 53. Maximum Subarray
- Leetcode 53. Maximum Subarray
- Leetcode题解 53. Maximum Subarray 思路解析
- LeetCode 53. Maximum Subarray