53. Maximum Subarray(补上周)
来源:互联网 发布:网络购物街图片 编辑:程序博客网 时间:2024/06/07 00:18
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
.
click to show more practice.
Subscribe to see which companies asked this question.
dp[i + 1] = max(dp[i], dp[i] + a[i + 1])
代码如下:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = 0;
int n=nums.size();
int m = INT_MIN;
for(int i = 0; i < n; i++) {
sum += nums[i];
m = max(m, sum);
//如果sum小于0了,将sum重置为0,从i + 1再次开始计算
if(sum < 0) {
sum = 0;
}
}
return m;
}
};
阅读全文
0 0
- 53. Maximum Subarray(补上周)
- [LeetCode]53.Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- 53.Maximum Subarray
- [Leetcode] 53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 53.Maximum Subarray
- 53. Maximum Subarray
- 【leetcode】53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- 53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 53. Maximum Subarray LeetCode
- 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 牛客网中选择题目及知识详解
- 面向对象技术
- HTTP请求、响应头、体、行
- bootstrap validator 提供了哪些验证函数
- C++函数参数中的省略号用法分析
- 53. Maximum Subarray(补上周)
- java获取随机字母数字组合
- mysql中order by优化的那些事儿
- Android 事件分发机制
- Linux 使用技巧——0001
- Maven经典错误之三:was cached in the local repository, resolution will not be reattempted until the upda
- Android打开/关闭wifi命令
- 为什么没有dev_debug函数???
- idhttp下载文件添加进度条