LeetCode 1031

题目描述：

1031. 两个非重叠子数组的最大和 - 力扣（LeetCode）

思路：

前缀和+暴力扫描

代码：

class Solution {
public:
    int maxSumTwoNoOverlap(vector<int>& nums, int firstLen, int secondLen) {

        int len = nums.size();
        vector<int> preSum(len+1,0);
        for(int i = 1 ; i <= nums.size(); i++)
        {
            preSum[i] += preSum[i-1] + nums[i-1];
        }


        int l = getTheMaxAns(preSum,firstLen,secondLen);
        int r = getTheMaxAns(preSum,secondLen,firstLen);

        return max(l,r);

    }
private:
    int getTheMaxAns(const vector<int>& preSum , int firstLen , int secondLen)
    {
        int maxAns = INT_MIN;
        int len = preSum.size();

        for(int i = firstLen ; i < len ; i++)
        {
            for(int j = secondLen+i; j < len ; j++)
            {
                int l = preSum[i] - preSum[i - firstLen];
                int r = preSum[j] - preSum[j - secondLen];
                
                // cout<<"l:"<<l<<" ";
                // cout<<"r:"<<r<<endl;
                maxAns = max(maxAns,l+r);
            }
        }

        return maxAns;
    }
};