class Solution {
public:
int maxSubArray(vector<int>& nums)
{
const int n=nums.size();
int maxSum=0; //每一段的最大值,局部最优
int result=INT_MIN; //全局最优
for(int i=0;i<n;++i)
{
if(maxSum>0)
maxSum+=nums[i];
else
maxSum=nums[i];
result=max(result,maxSum);
}
return result;
}
};
Maximum Subarray
最新推荐文章于 2019-07-03 04:34:57 发布