LeetCode-53-Maximum Subarray(DP/分治)-Medium
来源:互联网 发布:闹钟软件 编辑:程序博客网 时间:2024/05/22 03:47
题意理解:
求解数列中的子数列,要求子数列的和最大;
题目分析:
1. DP(如解题代码所示);
2. 分治(参考http://www.2cto.com/kf/201403/289418.html)
解题代码:
class Solution {public: int maxSubArray(vector<int>& nums) { int size=nums.size(); int sum=0; int max=INT_MIN; for(int i=0; i<size; i++){ sum+=nums[i]; if(sum>max){ max=sum; } if(sum<0){ sum=0; } } return max; }};
0 0
- LeetCode-53-Maximum Subarray(DP/分治)-Medium
- 【LeetCode】53. Maximum Subarray (Medium)
- (Leetcode)53. Maximum Subarray(medium)
- 53. Maximum Subarray 难度:medium 类别:分治
- LeetCode 53/152 Maximum Subarray/Maximum Product Subarray---DP **
- 【Leetcode】Maximum Subarray (DP)
- LeetCode Maximum Subarray DP
- [leetcode][DP]Maximum Subarray
- Medium 53题 Maximum Subarray
- [Leetcode 152, Medium] Maximum Product Subarray
- Leetcode 152. Maximum Product Subarray (Medium) (cpp)
- Leetcode 53. Maximum Subarray (Medium) (cpp)
- LeetCode解题报告 53. Maximum Subarray [medium]
- Leetcode 53. Maximum Subarray (Medium) (java)
- 【LeetCode】152. Maximum Product Subarray (Medium)
- DP Leetcode - Maximum Product Subarray
- 【Leetcode】Maximum Product Subarray (DP)
- (DP)LeetCode#53. Maximum Subarray
- [POJ 3255]Roadblocks[dijkstra][次短路]
- 学习笔记(二)——直方图均衡化和匹配
- 小结NSString 以后还会补充
- nginx机制-从源码分析(1)
- Executor和ExecutorService
- LeetCode-53-Maximum Subarray(DP/分治)-Medium
- 消息队列NetMQ使用介绍
- UNREAL FRAMEWORK & NETWORK
- 算法实现两个数交换(多种方法)
- UITextFielddelegate委托方法注释
- Python 遍历字典——学习笔记
- iOS学习之路-超级猜图
- iOS开发检测项目中哪个库包含了idfa
- vim 配置