leetcode--53. Maximum Subarray
2017-03-19 12:05
489 查看
Question:
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
思想:设一个int sum 表示和,假如子列的前面的元素的和sum大于等于0,则把sum加到这子列一定比原来的子列大.
如果小于零了,就将sum对应的那个子列删去,sum重新开始。其中令一个max_sum来表示最大的和。
具体代码实现如下:class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = 0;
int max_sum = INT_MIN;
int n = nums.size();
for(int i = 0; i < n; i++){
if(sum >= 0){
sum += nums[i];
}else{
sum = nums[i];
}
if(sum > max_sum){
max_sum = sum;
}
}
return max_sum;
}
};
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
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.
思想:设一个int sum 表示和,假如子列的前面的元素的和sum大于等于0,则把sum加到这子列一定比原来的子列大.
如果小于零了,就将sum对应的那个子列删去,sum重新开始。其中令一个max_sum来表示最大的和。
具体代码实现如下:class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = 0;
int max_sum = INT_MIN;
int n = nums.size();
for(int i = 0; i < n; i++){
if(sum >= 0){
sum += nums[i];
}else{
sum = nums[i];
}
if(sum > max_sum){
max_sum = sum;
}
}
return max_sum;
}
};
相关文章推荐
- 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
- LeetCode53. Maximum Subarray
- LeetCode - 53. Maximum Subarray
- Leetcode 53. Maximum Subarray
- leetcode - 53. Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- 【LeetCode】53. Maximum Subarray
- [LeetCode] Algorithms-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