[LeetCode] 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.

click to show more practice.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

分析：

可用一维的dp解决。其中table[i]表示的是包含A{i]的maximum subarray。

代码：（O(n)）

class Solution {
public:
	int maxSubArray(int A[], int n) {
		vector<int> table (n, 0);
		table[0] = A[0];
		int result = A[0];
		for (int i = 1; i < n; i ++) {
			table[i] = A[i] + (table[i-1] > 0 ? table[i-1] : 0);
			result = max(result, table[i]);
		}
		return result;
	}
};

可以使用滚动table来代替真正的table，这样空间变成了O(1)

class Solution {
public:
	int maxSubArray(int A[], int n) {
		int prev = A[0];
		int curr = 0;
		int result = A[0];
		for (int i = 1; i < n; i ++) {
            curr = A[i] + (prev > 0 ? prev : 0);
			result = max(result, curr);
		    prev = curr;
		}
		return result;
	}
};