Lintcode 42. Maximum Subarray II

最新推荐文章于 2021-09-06 00:27:18 发布

_忽如远行客

最新推荐文章于 2021-09-06 00:27:18 发布

阅读量201

点赞数

分类专栏：算法贪心算法

本文链接：https://blog.csdn.net/gulaixiangjuejue/article/details/80572827

版权

算法同时被 2 个专栏收录

60 篇文章 0 订阅

订阅专栏

贪心算法

5 篇文章 0 订阅

订阅专栏

 
 42. Maximum Subarray II 

Given an array of integers, find two non-overlapping subarrays which have the largest sum.
The number in each subarray should be contiguous.
Return the largest sum.

ExampleFor given [1, 3, -1, 2, -1, 2], the two subarrays are [1, 3] and [2, -1, 2] or [1, 3, -1, 2] and [2], they both have the largest sum 7.

ChallengeCan you do it in time complexity O(n) ?

class Solution {
public:
    /*
     * @param nums: A list of integers
     * @return: An integer denotes the sum of max two non-overlapping subarrays
     */
    
    int maxTwoSubArrays(vector<int> &nums) {
        // write your code here
     int left[nums.size()];int right[nums.size()];
     int leftMax = nums.at(0); int leftSum = nums.at(0);
     left[0]= nums.at(0);
     for(int i = 1;i<nums.size();i++){
      if(leftSum<0)
         leftSum = 0;
      leftSum += nums.at(i);
      if(leftMax<leftSum)
         leftMax = leftSum;
      left[i] = leftMax;
     }
     
     int rightMax = nums.at(nums.size()-1); int rightSum = nums.at(nums.size()-1);
     right[nums.size()-1]=nums.at(nums.size()-1);
     for(int i = nums.size()-2;i>=0;i--){
      if(rightSum<0)
        rightSum = 0;
      rightSum += nums.at(i);
      if(rightMax<rightSum)
         rightMax = rightSum;
      right[i]=rightMax;
     }
   
     int Max = left[0]+right[1];
     for(int j = 1;j<nums.size()-1;j++){
         if(Max < left[j]+right[j+1])
            Max = left[j]+right[j+1];
     }
     return Max;
    }
};

刚开始用vector存储left和right两个数组，发现不能在特定位置插入数据，故舍弃；

用空间换时间