2017.3.2 53. 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.

click to show more practice.

Subscribe to see which companies asked this question

找出数组中最大数组

参考经典算法  Kadane's algorithm。时间复杂度显然是O(N)因为数组只被扫描了一遍。 

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

把之前的数组和看做一个数 是负的就舍去   是正的留下    保留一个最大数。