LeetCode53. Maximum Subarray一种很好的做法
来源:互联网 发布:淘宝怎么装修模板 编辑:程序博客网 时间:2024/05/01 00:07
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
.
Solution:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = 0;
int val = nums[0];
for (int i = 0; i < nums.size(); i++)
{
sum += nums[i];
if (val < sum) {
val = sum;
}
if (sum < 0) {
sum = 0;
}
}
return val;
}
};
注意点:
1. val的初值是nums[0]
2. 如果val < sum 则 val = sum;
3. 如果sum小于 0 则sum重置0,但这一步是在给val赋值之后。
阅读全文
0 0
- LeetCode53. Maximum Subarray一种很好的做法
- 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[easy]--Maximum Subarray
- LeetCode53——Maximum Subarray
- Leetcode53——Maximum Subarray
- playfair密码
- 音视频同步(播放)原理
- 微信小程序商店:极乐小程序商店推荐之601~700
- Mac 10.11.4 opengl开发环境配置
- bzoj 1010: [HNOI2008]玩具装箱toy(斜率dp)
- LeetCode53. Maximum Subarray一种很好的做法
- picasso 源码解析
- python seek() 有条件的打印出末尾几行
- 【资源共享】《RK3399 VR Sensor 开发指南》
- 蓝牙BLE基础:CC2541 BLE临界资源保护
- 第十一章 字符串和字符串函数
- View绘制流程
- shiro 用户权限管理(1)----配置 (springmvc+jpa+hibernate+maven环境)
- solr进阶