Maximum Subarray

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

weixin_30376323

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

阅读量52

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/happygirl-zjj/p/4574649.html

本文详细介绍了如何找到给定数组中连续子数组的最大和。通过实例演示和代码实现，帮助读者理解最大子数组和问题的核心算法。

Description:

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.

Code:

 int maxSubArray(vector<int>& nums) {
       if (nums.size()!=0)
              return INT_MIN;
        int maxValue = nums[0] ;
        int temp = nums[0];
        for (int i = 1; i < nums.size(); ++i)
        {
            temp += nums[i];
            if (temp > maxValue)
                maxValue = temp;
            if (temp < 0)
            {
                temp = 0;
            }
        }
        return maxValue;
    }