LeetCode 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

.

最大子序列问题，《数据结构与算法分析》黑书上经典的入门问题

O(n)复杂度的线性算法

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