53. Maximum Subarray
来源:互联网 发布:盒子设计软件绿色版 编辑:程序博客网 时间:2024/06/15 13:59
1刷
简单dp,求子串最大和
class Solution {public: int maxSubArray(vector<int>& nums) { int sum = 0; int maxx = nums[0]; for(int i = 0; i < nums.size(); ++ i){ sum += nums[i]; if(sum > maxx) maxx = sum; if(sum < 0) sum = 0; } return maxx; }};
2刷
Dp….不用3刷的题
class Solution {public: int maxSubArray(vector<int>& nums) { int maxx = INT_MIN; int sum = 0; for(int i = 0; i < nums.size(); ++ i){ sum += nums[i]; if(sum > maxx) maxx = sum; if(sum < 0) sum = 0; } return maxx; }};
0 0
- [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
- 53. Maximum Subarray
- 内部排序之插入排序:直接插入排序,折半插入排序,希尔排序
- [LeetCode]398. Random Pick Index
- OpenCV实践(4)- 叠加两幅图片
- 51. N-Queens
- 52. N-Queens II
- 53. Maximum Subarray
- POJ3268【最短路】
- 54. Spiral Matrix
- Light OJ 1282 Leading and Trailing (对数+快速幂)
- I AM ARRIVAL, I AM COMING.
- 55. Jump Game
- 56. Merge Intervals
- 57. Insert Interval
- 58. Length of Last Word