leetccode 53. Maximum Subarray
来源:互联网 发布:金蝶java面试题 编辑:程序博客网 时间:2024/05/22 01:04
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
.
方法:动态规划,找转移状态,
如果前面的sum<0,则sum=nums[i]
否则,sum+=nums[i]
每一步找一次最大
class Solution {public: int maxSubArray(vector<int>& nums) { int sum = 0; int maxa = INT_MIN; for(int i = 0; i < nums.size(); i++) { if (sum >= 0) sum += nums[i]; else sum = nums[i]; maxa = max(maxa, sum); } return maxa; }};
阅读全文
0 0
- leetccode 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
- 1.Two Sum
- Python Image模块API
- Xcode_自定义代码块
- starring V6平台开发接出点流程
- QT5串口编写
- leetccode 53. Maximum Subarray
- java设计模式(十六)——责任链模式(Chain of Responsibility)
- winsock 常用数据结构
- Django--4--views.py详解
- C#设计模式(1)——单例模式
- Oracle 11g服务器安装详细步骤——图文教程
- CentOS 安装 微软雅黑字体
- SpringBoot整合jersey
- MS-SSTR Smooth Streaming 协议