You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
/*/*******************************************************************************
|
|
|
|
|
|
** **
|
|
|
|
|
|
** Jiedi(China nanjing)Ltd. **
|
|
|
|
|
|
** 创建：丁宋涛 夏曹俊，此代码可用作为学习参考 **
|
|
|
|
|
|
*******************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************FILE INFOMATION***********************************
|
|
|
|
|
|
**
|
|
|
|
|
|
** Project : 算法设计与编程实践---基于leetcode的企业真题库
|
|
|
|
|
|
** Contact : xiacaojun@qq.com
|
|
|
|
|
|
** 博客 : http://blog.csdn.net/jiedichina
|
|
|
|
|
|
** 视频课程 : 网易云课堂 http://study.163.com/u/xiacaojun
|
|
|
|
|
|
腾讯课堂 https://jiedi.ke.qq.com/
|
|
|
|
|
|
csdn学院 https://edu.csdn.net/course/detail/25037
|
|
|
|
|
|
** 51cto学院 http://edu.51cto.com/lecturer/index/user_id-100013755.html
|
|
|
|
|
|
** 老夏课堂 http://www.laoxiaketang.com
|
|
|
|
|
|
**
|
|
|
|
|
|
** 算法设计与编程实践---基于leetcode的企业真题库 课程群 ：296249312 加入群下载代码和交流
|
|
|
|
|
|
** 微信公众号 : jiedi2007
|
|
|
|
|
|
** 头条号 : 夏曹俊
|
|
|
|
|
|
**
|
|
|
|
|
|
*****************************************************************************
|
|
|
|
|
|
//！！！！！！！！！ 算法设计与编程实践---基于leetcode的企业真题库 课程 QQ群：296249312 下载代码和交流*/
|
|
|
|
|
|
/*
|
|
|
|
|
|
* @lc app=leetcode.cn id=53 lang=cpp
|
|
|
|
|
|
*
|
|
|
|
|
|
* [53] 最大子序和
|
|
|
|
|
|
sum[i]:用来计算第i个元素连续和
|
|
|
|
|
|
sum[i] max(sum[i-1]+a[i], a[i])
|
|
|
|
|
|
*/
|
|
|
|
|
|
#include <vector>
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
class Solution {
|
|
|
|
|
|
public:
|
|
|
|
|
|
int maxSubArray(vector<int>& nums) {
|
|
|
|
|
|
int sum = nums[0];
|
|
|
|
|
|
int n = nums[0];
|
|
|
|
|
|
for(int i =1;i<nums.size();i++){
|
|
|
|
|
|
if(n>0)
|
|
|
|
|
|
n+=nums[i];
|
|
|
|
|
|
else
|
|
|
|
|
|
n = nums[i];
|
|
|
|
|
|
if(sum < n)
|
|
|
|
|
|
sum = n;
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
return sum;
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
|
