Question
Given an integer array nums
, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6.
Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Answer
class Solution { public: int maxSubArray(vector<int>& nums) { vector<int> dp(nums.size()); dp[0] = nums[0]; int max = dp[0]; for (int i = 1; i < nums.size(); i++) { if (dp[i-1] < 0) { dp[i] = nums[i]; } else { dp[i] = dp[i-1] + nums[i]; } if (max < dp[i]) max = dp[i]; } return max; } };
动态规划,dp[i]代表当前最大连续子数组的值,所以如果dp[i-1]小于零,则不被dp[i]考虑在里面。