2017.3.2 53. Maximum Subarray
来源:互联网 发布:用java写九九乘法表 编辑:程序博客网 时间:2024/05/20 19:50
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
找出数组中最大数组
参考经典算法 Kadane's algorithm。时间复杂度显然是O(N)因为数组只被扫描了一遍。
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int max_num=INT_MIN
int num=0;
for(int i=0;i<nums.size() ;i++)
{
if(num>=0)
{
num+=nums[i];
}
else
{
num=num[i];
}
if(num>max_num)
{
max_num=num;
}
}
return max_num;
};
把之前的数组和看做一个数 是负的就舍去 是正的留下 保留一个最大数。
0 0
- 2017.3.2 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
- 插入排序
- from skimage.restoration import denoise_tv_chambolle 出现错误
- dsf sd
- Unknown version of Tomcat was specified
- windows系统下安装python的pip工具
- 2017.3.2 53. Maximum Subarray
- 将网页保存为图片
- easymock快速入门
- C++ primer中有趣的东西
- MySql之表记录操作(增删改)
- 软素质学堂
- 九度OJ学习笔记 题目1070
- 新手上路
- mybatis延迟加载