题目:
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.
题意:
找出数组中的连续子数组,该连续子数组的元素之和最大。
思路:采用的动态规划思路。计算出以第i个元素为结束元素的子数组的和是f[i]:
- f[0] = array[0];
- 如果f[i]<0,那么判断f[i]是否比最大值max_sum大,是的话 max_sum = f[i]。此时f[i+1] = array[i+1];
- 如果f[i] > 0,那么判断array[i+1]是否小于0,若array[i+1] < 0,那么判断max_sum是否小于f[i],若是max_sum = f[i]。更新f[i+1] = f[i] + array[i+1];
以上。
代码如下:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
if(nums.size() == 0)return 0;
int *f = new int[nums.size()];
f[0] = nums[0];
int max_sum = 0x80000000;
for(int j = 1; j < nums.size(); j++){
if(f[j-1] < 0){
if(max_sum < f[j-1])max_sum = f[j-1];
f[j] = nums[j];
}
else{
f[j] = f[j-1] + nums[j];
if(nums[j] < 0 && max_sum < f[j-1])max_sum = f[j-1];
}
}
if(f[nums.size() - 1] > max_sum)max_sum = f[nums.size() - 1];
return max_sum;
}
};