关闭

算法-Maximum Subarray: a simpler solution

标签: leetcodearraymax-subarysimulate
1103人阅读 评论(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.

代码实现

    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

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    Leetcode Solutions in Github

    Click me

    Leetcode solutions in Github, including tags: Array, HashTable, Stack, Queue, LinkedList, Tree, Graph,...

    leetcode-manager

    Click me

    Current Leetcode manager: it's used by Entity Framework, WinForms, Sql Server to manage leetcode questions that we have done. Functions include tags creation, revise and deletion, and questions creation, edit and deletion.

    个人资料
    • 访问:127469次
    • 积分:5059
    • 等级:
    • 排名:第5851名
    • 原创:312篇
    • 转载:0篇
    • 译文:0篇
    • 评论:53条
    博客专栏