Maximum Subarray

最新推荐文章于 2025-05-15 16:32:28 发布

原创最新推荐文章于 2025-05-15 16:32:28 发布 · 215 阅读

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.

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