【LeetCode】C# 53、Maximum Subarray

最新推荐文章于 2022-03-05 22:10:08 发布

RUN_D

最新推荐文章于 2022-03-05 22:10:08 发布

阅读量368

点赞数

分类专栏： leetcode 文章标签： leetcode c#

本文链接：https://blog.csdn.net/qq_39643935/article/details/78225843

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

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[] dp 来存储遍历到某一位时前面正区间的和的值。

public class Solution {
    public int MaxSubArray(int[] nums) {
        int n = nums.Length;
        int[] dp = new int[n];
        dp[0] = nums[0];
        int max = dp[0];

        for(int i = 1; i < n; i++){
            dp[i] = nums[i] + (dp[i - 1] > 0 ? dp[i - 1] : 0);
            max = Math.Max(max, dp[i]);
        }

        return max;
    }
}