LeetCode53. Maximum Subarray一种很好的做法
2017-06-30 17:25
162 查看
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array
the contiguous subarray
Solution:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = 0;
int val = nums[0];
for (int i = 0; i < nums.size(); i++)
{
sum += nums[i];
if (val < sum) {
val = sum;
}
if (sum < 0) {
sum = 0;
}
}
return val;
}
};
注意点：
1. val的初值是nums[0]
2. 如果val < sum 则 val = sum;
3. 如果sum小于 0 则sum重置0，但这一步是在给val赋值之后。
For example, given the array
[-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray
[4,-1,2,1]has the largest sum =
6.
Solution:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = 0;
int val = nums[0];
for (int i = 0; i < nums.size(); i++)
{
sum += nums[i];
if (val < sum) {
val = sum;
}
if (sum < 0) {
sum = 0;
}
}
return val;
}
};
注意点：
1. val的初值是nums[0]
2. 如果val < sum 则 val = sum;
3. 如果sum小于 0 则sum重置0，但这一步是在给val赋值之后。
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【LeetCode】 53. Maximum Subarray 最大子序列和
- leetcode 53. Maximum Subarray python
- leetcode-53. Maximum Subarray
- 小白笔记-----------------------------leetcode53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- LeetCode53. Maximum Subarray
- leetcode--53. Maximum Subarray
- [LeetCode] 53. Maximum Subarray
- leetcode 152. Maximum Product Subarray 最大连乘子序列 + 很棒的动态规划DP做法
- 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 最大连续子串python实现【medium】
- [LeetCode]53. Maximum Subarray
- leetcode: 53. Maximum Subarray
- [leetcode] 53. Maximum Subarray
- LeetCode 53. Maximum Subarray 题解