【LeetCode】C# 53、Maximum Subarray

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;    }}