【LeetCode 1024】 Video Stitching

题目描述

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 [0,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.

Note:

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

思路

思路一： 动态规划。遍历所有视频，对每个视频，遍历所有可能的区间，尝试填补区间。dp[i][j]表示该区间需要的最少视频数。
思路二： 贪心，视频按照起点和终点都是从小到大排序，设置一个当前到达的实际位置，和可能到达的最后位置，在满足条件的情况下，要取的下一个是能够到达最远位置的视频。
有点绕。如果下一段视频的起点大于当前实际终点了，说明上一段视频的最远位置也到不了终点，一定要新取一个了，res++。同时当前potentialend记录的是上一个符合条件的最远位置，更新当前实际位置为上一段能取的最远位置。

代码

动态规划：

class Solution {
   
public:
    int videoStitching(vector<vector<int>>& clips, int T) {
   
        int n = clips.size();
        int INF = 101;
        vector<vector<int