算法设计Week7 LeetCode Algorithms Problem #53 Maximum Subarray

题目描述：

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.

---

题目分析：

其实在分析这道题时很容易陷入误区，就是将子问题归结为“找前k个元素中的最大子序列”。如果将子问题这样归结，就会导致情况过于复杂而无法继续分析。如果将子问题归结为“找前k个元素中包含第k个元素的最大子序列”，问题分析起来就变得容易多了：

subarray[k] = max((subarray[k - 1] + nums[k]), nums[k]);

下面是具体代码，时间复杂度是O(n)，空间复杂度为O(n)：

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int result;
        vector<int> subarray(nums.size(),0);
        subarray[0] = nums[0];
        result = subarray[0];
        for(int i = 1; i < nums.size(); i++){
            subarray[i] = max((subarray[i - 1] + nums[i]), nums[i]);
            result = max(result,subarray[i]);
        }
        return result;
    }
};