算法-Maximum Subarray: a simpler solution

来源：互联网发布：java开源编辑：程序博客网时间：2024/05/31 18:45

原题

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.

代码实现

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

模拟

这里写图片描述

leetcode测试结果

这里写图片描述

Array
http://download.csdn.net/detail/daigualu/9829402
DP
http://download.csdn.net/detail/daigualu/9829404
Tree
http://download.csdn.net/detail/daigualu/9829406
Stack
http://download.csdn.net/detail/daigualu/9829405
及其他

leetcode-solution库

leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp

2 0