[leetcode] 1477. Find Two Non-overlapping Sub-arrays Each With Target Sum

Description

Given an array of integers arr and an integer target.

You have to find two non-overlapping sub-arrays of arr each with sum equal target. There can be multiple answers so you have to find an answer where the sum of the lengths of the two sub-arrays is minimum.

Return the minimum sum of the lengths of the two required sub-arrays, or return -1 if you cannot find such two sub-arrays.

Example 1:

Input: arr = [3,2,2,4,3], target = 3
Output: 2
Explanation: Only two sub-arrays have sum = 3 ([3] and [3]). The sum of their lengths is 2.

Example 2:

Input: arr = [7,3,4,7], target = 7
Output: 2
Explanation: Although we have three non-overlapping sub-arrays of sum = 7 ([7], [3,4] and [7]), but we will choose the first and third sub-arrays as the sum of their lengths is 2.

Example 3:

Input: arr = [4,3,2,6,2,3,4], target = 6
Output: -1
Explanation: We have only one sub-array of sum = 6.

Example 4:

Input: arr = [5,5,4,4,5], target = 3
Output: -1
Explanation: We cannot find a sub-array of sum = 3.

Example 5:

Input: arr = [3,1,1,1,5,1,2,1], target = 3
Output: 3
Explanation: Note that sub-arrays [1,2] and [2,1] cannot be an answer because they overlap.

Constraints:

• 1 <= arr.length <= 10^5
• 1 <= arr[i] <= 1000
• 1 <= target <= 10^8

分析

题目的意思是：找出数组中等于target的最小非重叠区间的长度，用dp[i]表示当前i以及i之前的满足条件的最小区间长度,状态更新规则为

dp[i]=min(dp[i-1],i-j+1) if sum[j,i]=target

答案更新规则

res=min(res,dp[j−1]+i−j+1)

表示当前以i结尾的满足条件的区间长度与j-1之前的最小的区间长度之和，这样就能满足两个窗口不重叠且长度之和最小。

代码

class Solution:
    def minSumOfLengths(self, arr: List[int], target: int) -> int:
        n=len(arr)
        dp=[float('inf')]*n
        cur=0
        s=0
        res=float('inf')
        min_len=float('inf')
        for i in range(n):
            cur+=arr[i]
            while(cur>target):
                cur-=arr[s]
                s+=1
            if(cur==target):
                cur_len=i-s+1
                if(s>0 and dp[s-1]!=float('inf')):
                    res=min(res,cur_len+dp[s-1])
                min_len=min(min_len,cur_len)
            dp[i]=min_len
        return -1 if(res==float('inf')) else res

参考文献

一次遍历，滑动窗口加动态规划