Leetcode-53. Maximum Subarray
来源:互联网 发布:广州小孩学编程 编辑:程序博客网 时间:2024/06/10 16:30
题目:
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
.
click to show more practice.
Subscribe to see which companies asked this question
AC代码:
class Solution {public:int maxSubArray(vector<int>& nums) {int size = nums.size();if (size == 0)return 0;vector<int>sum(size,0);int maxsum = INT_MIN;for (int i = 0; i < size;i++){sum[i] = i>0?max(sum[i-1]+nums[i],nums[i]):nums[i];if (sum[i]>maxsum)maxsum = sum[i];}return maxsum;}};
解析:
代码中sum[i]是以nums[i]为最后一个元素的最大连续子串和。如果sum[i-1]加上nums[i]的值没有num[i]大,则sum[i]=nums[i],否则sum[i]=sum[i-1]+
nums[i]。
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
- python -- 字符异或交换
- 哈理工 1812 小乐乐想出门
- socket.io.js
- 【WPF】MVVM前台绑定一组RadioButton按钮
- CVE-2016-7200&7201源码分析
- Leetcode-53. Maximum Subarray
- 根据图片url写入图片到制定位置
- arukas 的 Endpoint
- LeetCode 448. Find All Numbers Disappeared in an Array
- 2.系统开发基础-软件开发方法(2)
- CONCAT(字符串连接函数)和GROUP_CONCAT的一个例子
- 栈的解析及C++实现
- Python NLTK 学习笔记1
- Android中点击事件的4中写法