题目描述:
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
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.
题目大意:找出数组中最大的连续的数字和。
思路:dp一下,状态转移方程是:dp[i] = max{nums[i], nums[i] + dp[i - 1]},再用一个max值记录最大值即可。
c++代码:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
vector<int> dp;
dp.push_back(nums[0]);
int ans = nums[0];
for (int i = 1; i < nums.size(); i++)
{
int temp = nums[i] > nums[i] + dp[i - 1] ? nums[i] : nums[i] + dp[i - 1];
dp.push_back(temp);
ans = dp[i] > ans ? dp[i] : ans;
}
return ans;
}
};