41. Maximum Subarray

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

foradawn

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

阅读量197

点赞数

CC 4.0 BY-SA版权

分类专栏： LintCode 文章标签： Subarray

本文链接：https://blog.youkuaiyun.com/foradawn/article/details/79879527

LintCode 专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一种寻找整数数组中连续子数组的最大和的算法。通过遍历数组并维护当前子数组之和，该算法能高效地找到具有最大总和的连续子数组。示例中使用了[-2,2,-3,4,-1,2,1,-5,3]，最大子数组为[4,-1,2,1]，其和为6。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

41. Maximum Subarray

Description

Given an array of integers, find a contiguous subarray which has the largest sum.
The subarray should contain at least one number.

Example

Given the array [−2,2,−3,4,−1,2,1,−5,3], the contiguous subarray [4,−1,2,1] 
has the largest sum = 6.

Solution

public class Solution {
    /**
     * @param nums: A list of integers
     * @return: A integer indicate the sum of max subarray
     */
    public int maxSubArray(int[] nums) {
        // write your code here
        int MaxSum = nums[0], ThisSum = 0;
        for(int i=0;i<nums.length;i++){
            ThisSum += nums[i];
            if(ThisSum > MaxSum){
                MaxSum = ThisSum;
            }else if(ThisSum < 0){
                ThisSum = 0;
            }
        }
        return MaxSum;
    }
}