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
.
也是leetcode上的题,https://leetcode.com/problems/maximum-subarray
用动态规范的方法解题
在遍历数组的时候,对于每个整数,只有两个选择,要么加入之前的序列,要么另起一个序列,而作出判断里依据为,之前的序列和是否大于0。
所以,如果dp[i]为数组A以A[i]结尾最大的sum值,那么dp[i+1] = max { dp[i] + A[i+1], A[i+1]}
class Solution {
public:
int max(int a, int b)
{
return a > b ? a : b;
}
int maxSubArray(vector<int>& nums) {
int max_local = nums[0];
int max_global = nums[0];
for(int i = 1; i < nums.size(); i++)
{
max_local = max(nums[i], max_local + nums[i]);
max_global = max(max_global, max_local);
}
return max_global;
}
};