#45 Maximum Subarray Difference

最新推荐文章于 2022-04-07 23:14:21 发布

易月

最新推荐文章于 2022-04-07 23:14:21 发布

阅读量484

点赞数

分类专栏： lintcode 文章标签： lintcode dynamic programming

本文链接：https://blog.csdn.net/haifischxia/article/details/52343753

版权

lintcode 专栏收录该内容

217 篇文章 0 订阅

订阅专栏

题目描述：

Given an array with integers.

Find two non-overlapping subarrays A and B, which|SUM(A) - SUM(B)| is the largest.

Return the largest difference.

Notice

The subarray should contain at least one number

Have you met this question in a real interview?

Yes

Example

For [1, 2, -3, 1], return 6.

Challenge

O(n) time and O(n) space.

题目思路：

这题还是用forward-backward traversal的想法，left类vector算出i以左subarray的最大sum和最小sum，right类vector算出i以右subarray的最大sum和最小sum。然后重新遍历array，找出最大difference就可以了。

Mycode（AC = 39ms）：

class Solution {
public:
    /**
     * @param nums: A list of integers
     * @return: An integer indicate the value of maximum difference between two
     *          Subarrays
     */
    int maxDiffSubArrays(vector<int> nums) {
        // write your code here
        if (nums.size() == 0) {
            return 0;
        }
        
        vector<int> left_min(nums), left_max(nums),
                    right_min(nums), right_max(nums);
                    
        // get the left_min and left_max
        int local_min = nums[0], local_max = nums[0];
        for (int i = 1; i < nums.size(); i++) {
            local_min = min(local_min + nums[i], nums[i]);
            local_max = max(local_max + nums[i], nums[i]);
            
            left_min[i] = min(left_min[i - 1], local_min);
            left_max[i] = max(left_max[i - 1], local_max);
        }
        
        // get the right_min and right_max
        local_min = nums[nums.size() - 1];
        local_max = nums[nums.size() - 1];
        
        for (int i = nums.size() - 2; i >= 0; i--) {
            local_min = min(local_min + nums[i], nums[i]);
            local_max = max(local_max + nums[i], nums[i]);
            
            right_min[i] = min(right_min[i + 1], local_min);
            right_max[i] = max(right_max[i + 1], local_max);
        }
        
        // get the max diff
        int diff = 0;
        for (int i = 1; i < nums.size(); i++) {
            diff = max(abs(right_max[i] - left_min[i - 1]), 
                       max(diff, abs(right_min[i] - left_max[i - 1])));
        }
        
        return diff;
    }
};