Subarray 问题关键: 利用前缀和
sum[i] = num[0] + num[1] + num[2] + ....... + num[ i ] ;
1 Maximum Subarray / Minimum Subarray
Two Method:
(1 )use prefix sum
(2) Sliding Window
2 Maximum Subarray II (from lintcode)
记录left, right max sum, 然后求最大的left [i] + right[i+1]
public int maxTwoSubArrays(ArrayList<Integer> nums) {
if(nums == null || nums.size() == 0){
return 0;
}
int n = nums.size();
int rightmax[] = new int[n];
rightmax[n -1] = nums.get(n -1);
int max = nums.get(n -1 );
for (int i = n - 2; i >= 0; --i) {
max = Math.max(nums.get(i), nums.get(i) + max);
rightmax[i] = Math.max(rightmax[i + 1], max);
}
// no need to store left max in an array
int leftmax = nums.get(0);
int res = leftmax + rightmax[1];
for (int i = 1; i < n - 1; i++) {
leftmax = (leftmax > 0 ? leftmax : 0 ) + nums.get(i);
res = Math.max(res, leftmax + rightmax[i + 1]);
}
return res;
}
3 Maximum Subarray Difference(lintcode)
主旨思想是用前缀和计算并保存leftMax,leftMin, rightMax, rightMin,
最后从左到右扫一遍,求maxdifference(一边取最大,一边取最小,注意组合为leftmax & rightMin 和 leftMin& rightMax)。
代码暂略