动态规划-最大连续字数

给定一个数组，求最大连续的子数组

解法1： 动态规划

  public static int MaxSubArray(int[] nums)
        {
            int maxLocal = nums[0];
            int global = nums[0];
            for(int i = 1; i < nums.Length; i++)
            {
                maxLocal = Math.Max(nums[i], nums[i] + maxLocal);
                global = Math.Max(global, maxLocal);
            }
            return global;
        }

解法2：

 public static int mcss(int[] nums,int begin,int end)
        {
            int n = end - begin;
            int[] sum = new int[n + 1];
            int result = int.MinValue;
            int cur_min = sum[0];

            for(int i = 1; i <= n; i++)
            {
                sum[i] = sum[i - 1] + nums[begin + i - 1];
            }

            for(int i = 1; i <= n; i++)
            {
                result = Math.Max(result, sum[i] - cur_min);
                cur_min = Math.Min(cur_min, sum[i]);
            }
            return result;
        }