53. Maximum Subarray LeetCode
来源:互联网 发布:js判断div滚动条 编辑:程序博客网 时间:2024/05/13 21:25
题意:给一个数组,求最大连续子段和。
题解:DP,dp代表局部最大子段和,maxsum代表全局最大子段和。
class Solution {public: int maxSubArray(vector<int>& nums) { int dp = 0,maxsum = -0x3f3f3f3f; int n = nums.size(); for(int i = 0; i < n; i++) { dp += nums[i]; maxsum = max(maxsum,dp); if(dp < 0) dp = 0; } return maxsum; }};
0 0
- [LeetCode]53.Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- [Leetcode] 53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 53. Maximum Subarray LeetCode
- [LeetCode]53. Maximum Subarray
- leetcode 53. Maximum Subarray
- [leetcode] 53. Maximum Subarray
- LeetCode *** 53. Maximum Subarray
- 【LeetCode】53. Maximum Subarray
- leetcode 53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- Leetcode:53. Maximum Subarray
- 108. Convert Sorted Array to Binary Search Tree LeetCode
- 重建二叉树
- 机器学习方法(七):Kmeans聚类K值如何选,以及数据重抽样方法Bootstrapping
- chrome浏览器Uncaught TypeError: object is not a function问题
- 静态链表实现
- 53. Maximum Subarray LeetCode
- C#八数码游戏实例
- 开机启动服务service示例
- 关于烂代码的那些事(下)
- 循环链表
- 230. Kth Smallest Element in a BST LeetCode
- SqlServer 数据页损坏还原测试
- 最全面的65条最常用正则表达式
- Cornerstone的创建分支Branch