LeetCode 53. Maximum Subarray
2016-11-16 12:51
399 查看
描述
求最大的连续子数组和解决
遍历。class Solution {
public:
int maxSubArray(vector<int>& nums) {
int length = nums.size();
int temp = -0xffff;
int res = 0;
vector<int> arr(length + 1, 0);
for (int i = 0; i < length; ++i)
{
if (nums[i] > temp)
temp = nums[i];
if (arr[i] + nums[i] > 0)
{
arr[i + 1] = arr[i] + nums[i];
res = max(arr[i + 1], res);
}
}
if (temp <= 0)
return temp;
return res;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode53. 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--3,Longest Substring Without Repeating Characters &&53. Maximum Subarray&&String.valueOf()
- 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 解题报告
- 【LeetCode】53. Maximum Subarray
- leetcode 53. Maximum Subarray
- LeetCode 53. Maximum Subarray