题目
Number: 53
Difficulty: Medium
Tags: Divide and Conquer, Array, Dynamic Programming
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
.
题解
在数组中找和最大的子数组。
用动态规划解决。
代码
动态规划1:
int maxSubArray(vector<int>& nums) {
int ans = nums[0], sum = 0;
for(int i = 0; i < nums.size(); ++i){
sum += nums[i];
ans = max(sum, ans);
sum = max(sum, 0);
}
return ans;
}
动态规划2:
int maxSubArray(vector<int>& nums) {
int ans = nums[0], sum = 0;
for(auto x : nums){
sum = sum > 0 ? sum + x : x;
ans = max(sum, ans);
}
return ans;
}