给定一个整数数组,找出两个不重叠的子数组A和B,使两个子数组和的差的绝对值|SUM(A) - SUM(B)|最大。
返回这个最大的差值。
样例
给出数组[1, 2, -3, 1],返回 6
注意:要特别注意细节的处理,如,如何保证不重叠
代码
class Solution {
public:
/*
* @param nums: A list of integers
* @return: An integer indicate the value of maximum difference between two substrings
*/
int maxDiffSubArrays(vector<int> &nums) {
// write your code here
const int n = nums.size();
if (n < 2) {
return 0;
}
vector<int> lMax(n), rMax(n), lMin(n), rMin(n);
for (int i = 0, peek = INT_MIN, sum = 0; i < n; i++)
//记住c++中表示最小值可以用INT_MIN
{
sum += nums[i];
peek = max(peek, sum);
lMax[i] = peek;
if (sum < 0)
sum = 0;
}
for (int i = n - 1, peek = INT_MIN, sum = 0; i >0; i--)
//此处i>0,保证rMax[i]与lMin[i]正好不重叠,下同
{
sum += nums[i];
peek = max(peek, sum);
rMax[i-1] = peek;
if (sum< 0) {
sum = 0;
}
}
for (int i = 0, peek = INT_MAX, sum = 0; i < n; i++)
{
sum += nums[i];
peek = min(sum, peek);
lMin[i] = peek;
if (sum > 0) {
sum = 0;
}
}
for (int i = n - 1, peek = INT_MAX, sum = 0; i >0; i--) //此处i>0
{
sum += nums[i];
peek = min(peek, sum);
rMin[i-1] = peek;
if (sum > 0) {
sum = 0;
}
}
int result = INT_MIN;
for (int i = 0; i < n - 1; i++) {
int temp = max(lMax[i] - rMin[i], rMax[i] - lMin[i]);
result = max(result, temp);
}
return result;
}
};