Leetcode53[easy]--Maximum Subarray
来源:互联网 发布:amtemu v0.8.1 mac 编辑:程序博客网 时间:2024/05/22 03:15
难度:easy
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
.
此题中设置一个局部最大值,一个整体最大值。
对于局部最大值,如果sum[i]>0,则sum[k+1]=sum[k]+nums[i+1]
如果sum[i]<0,则sum[k+1]=nums[i+1](从nums[i+1]重新开始)
整体最大值用来存储局部最大值,一旦出现更大的局部最大值就更新,最后返回整体最大值。
阅读全文
0 0
- Leetcode53[easy]--Maximum Subarray
- LeetCode53. Maximum Subarray(easy)
- LeetCode53:Maximum Subarray
- [Java]LeetCode53 Maximum Subarray
- Leetcode53 Maximum Subarray
- [leetcode53]Maximum Subarray
- LeetCode53. Maximum Subarray
- Leetcode53: Maximum Subarray
- LeetCode53. Maximum Subarray
- LeetCode53. Maximum Subarray题解
- leetcode53~Maximum Subarray
- leetcode53. Maximum Subarray
- LeetCode53 Maximum Subarray
- LeetCode53. Maximum Subarray
- LeetCode53. Maximum Subarray
- leetcode53. Maximum Subarray
- LeetCode53——Maximum Subarray
- Leetcode53——Maximum Subarray
- hdu 1505,1506
- 图论第三次课
- WEB编程:Interceptor与Filter
- Spring学习03
- 【STL】vector,string,queue,list,set用法及函数总结
- Leetcode53[easy]--Maximum Subarray
- 1-bit and 2-bit Characters[Leetcode 717]
- 人脸检测资料整理
- android 关于启动页广告的总结。
- 指针数组/数组指针
- 二叉树
- hadoop集群基准测试
- hdu 6229
- 五子棋AI 算法——极大极小搜索