[LeetCode]Maximum Subarray

标签：

Maximum Subarray

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.

抓住一个思路，如果前面序列的和小于0，则序列重新开始。

 1 class Solution {
 2 public:
 3     int maxSubArray(vector<int>& nums) {
 4         int result = INT_MIN,f=0;
 5         for(int i=0;i<nums.size();i++)
 6         {
 7             f = max(f+nums[i],nums[i]);
 8             result = max(result,f);
 9         }
10         return result;
11     }
12 };

[LeetCode]Maximum Subarray

标签：

原文地址：http://www.cnblogs.com/Sean-le/p/4787764.html