题目:
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.
分析:
寻找一个子串,使得它们的和最大。
思路:
[a1, a2, a3, a4, a5, a6, … an]
顺序遍历每个数,遍历到第n个数时,保存包含该位的最大数。即an = max(an-1 + an, an).最后遍历获取最大值即可。
这个跟在两个字符串里寻找最大子串是一样的问题。
分析:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
vector<int> result;
int len = nums.size();
int n = nums[0];
result.push_back(nums[0]);
for(int i = 1; i< len; i++)
{
if(result[i-1] > 0)
{
result.push_back(result[i -1] + nums[i]);
if((result[i -1] + nums[i]) > n) n = result[i -1] + nums[i];
}
else
{
result.push_back(nums[i]);
if(nums[i] > n) n = nums[i];
}
}
return n;
}
};