Maximum Subarray
来源:互联网 发布:淘宝搜索热度什么意思 编辑:程序博客网 时间:2024/06/01 10:26
题目:
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
.
我的解法:
(1)算法思想:
记sum=max=A[0],顺序遍历一次数组,将A[i]加到sum中,如果sum小于A[i],则用A[i]替换sum;如果sum大于max,则用sum替换max。遍历完,返回max即可。
(2)代码如下:
1 0
- maximum subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Managed Metadata Service Application(二)Managed Metadata Service Application常见错误
- (VC++2013)MFC自绘圆形按钮
- 1501181100-蓝桥杯-算法提高 复数归一化
- BaseDao类
- elasticsearch源码分析---threadpool模块
- Maximum Subarray
- eclipse 汉化版更新地址
- Robot Motion POJ 1573
- Android中 如何在本Activity页面退出后回到首页或者指定的Activity入口——诺诺"涂鸦"记忆
- 【iOS开发-104】SQLite使用:注意查询时分步写while会出现死循环
- SDUT14级寒假集训-找女朋友- 快排
- GridView(使用在TV或者盒子上)
- 【iOS7开发快速入门】代码示例3-4
- Mysql InnoDB和MyISAM的主要区别