[leetcode] 1024. Video Stitching

Description

You are given a series of video clips from a sporting event that lasted T seconds. These video clips can be overlapping with each other and have varied lengths.

Each video clip clips[i] is an interval: it starts at time clips[i][0] and ends at time clips[i][1]. We can cut these clips into segments freely: for example, a clip [0, 7] can be cut into segments [0, 1] + [1, 3] + [3, 7].

Return the minimum number of clips needed so that we can cut the clips into segments that cover the entire sporting event ([0, T]). If the task is impossible, return -1.

Example 1:

Input: clips = [[0,2],[4,6],[8,10],[1,9],[1,5],[5,9]], T = 10
Output: 3
Explanation: 
We take the clips [0,2], [8,10], [1,9]; a total of 3 clips.
Then, we can reconstruct the sporting event as follows:
We cut [1,9] into segments [1,2] + [2,8] + [8,9].
Now we have segments [0,2] + [2,8] + [8,10] which cover the sporting event [0, 10].

Example 2:

Input: clips = [[0,1],[1,2]], T = 5
Output: -1
Explanation: 
We can't cover [0,5] with only [0,1] and [1,2].

Example 3:

Input: clips = [[0,1],[6,8],[0,2],[5,6],[0,4],[0,3],[6,7],[1,3],[4,7],[1,4],[2,5],[2,6],[3,4],[4,5],[5,7],[6,9]], T = 9
Output: 3
Explanation: 
We can take clips [0,4], [4,7], and [6,9].

Example 4:

Input: clips = [[0,4],[2,8]], T = 5
Output: 2
Explanation: 
Notice you can have extra video after the event ends.

Constraints:

• 1 <= clips.length <= 100
• 0 <= clips[i][0] <= clips[i][1] <= 100
• 0 <= T <= 100

分析

题目的意思是：给定clips数组，表示的是视频的区间，求出能够组成T的最小视频区间的个数。这道题求最小，用动态规划的方法就是初始化为inf，用dp[i]表示视频片段[0,i)区间的最小长度，这样从1，遍历到T，得到dp[T]就是所求了。
对于任意区间c1,c2,如果满足i>c1 i<=c2,那么它可以覆盖[0,i)的后半部分，前半部分则用dp[c1]来计算就行了，所以递推公式为：

dp[i]=min(dp[i],dp[c1]+1)

接下来就是使用双循环遍历求dp[T]了，我写出来学习一下，哈哈。

代码

class Solution:
    def videoStitching(self, clips: List[List[int]], T: int) -> int:
        dp=[float('inf')]*(T+1)
        dp[0]=0
        for i in range(1,T+1):
            for c1,c2 in clips:
                if(i>c1 and i<=c2):
                    dp[i]=min(dp[i],dp[c1]+1)
        if(dp[T]==float('inf')):
            return -1
        return dp[T]

参考文献

[LeetCode] 视频拼接