leetcode 053 Maximum Subarray

最新推荐文章于 2021-12-20 16:36:02 发布

原创最新推荐文章于 2021-12-20 16:36:02 发布 · 283 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种寻找具有最大和的连续子数组的算法实现。通过遍历整数数组并维护一个当前和与最大和变量，该算法能在O(n)的时间复杂度内找到指定条件下的最优解。

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

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int sum = 0, maxx = INT_MIN;

		if(nums.size() == 0) return 0;
		
		for(int num : nums) {
			sum += num;

			if(sum > maxx) maxx = sum;

			if(sum < 0) sum = 0;
		}

		return maxx;
    }
};