Maximum Subarray

最新推荐文章于 2024-12-24 16:25:25 发布

junlon2006

最新推荐文章于 2024-12-24 16:25:25 发布

阅读量206

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/junlon2006/article/details/60867866

版权

leetcode 专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个用于寻找一维数组中具有最大和的连续子数组的算法实现。通过动态规划的方法，该算法能在O(n)的时间复杂度内找到并返回具有最大和的连续子数组的和。文章提供了两段C语言代码示例，分别展示了如何只返回最大子数组的和，以及如何同时返回最大子数组的具体元素。

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

https://leetcode.com/problems/maximum-subarray/?tab=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.

int maxSubArray(int* nums, int numsSize) {
    if(nums == NULL || numsSize == 0) return 0;
    int sum = nums[0], curMax = nums[0];
    for(int i = 1; i < numsSize; i++) {
        sum += nums[i];
        if(sum < nums[i]) sum = nums[i];
        if(sum > curMax) curMax = sum;
    }
    return curMax;
}

int maxSubArray(int* nums, int numsSize) {
    if(nums == NULL || numsSize == 0) return 0;
    int sum = nums[0], curMax = nums[0];
    int begin = 0, end = 0;
    for(int i = 1; i < numsSize; i++) {
        sum += nums[i];
        if(sum < nums[i]) {
            sum = nums[i];
            begin = i;
        }
        if(sum > curMax) {
            curMax = sum;
            end = i;
        }
    }
    for(int i = begin; i <= end; i++)
    printf("%d ", nums[i]);
    return curMax;
}