leetcode---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.

class Solution {
public:
int maxSubArray(vector<int>& nums)
{
int b = 0;
int sum = -100000;
for(int i=0; i<nums.size(); i++)
{
if(b >= 0)
b += nums[i];
else
b = nums[i];
if(b > sum)
sum = b;
}
return sum;
}
};