15算法课程 53. Maximum Subarray

最新推荐文章于 2025-09-10 14:02:06 发布

原创最新推荐文章于 2025-09-10 14:02:06 发布 · 260 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

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.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

solution:

code:

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