16 篇文章 0 订阅

# 1.题目

1024 Video Stitching

You are given a series of video clips from a sporting event that lasted time seconds. These video clips can be overlapping with each other and have varying lengths.
Each video clip is described by an array clips where clips[i] = [starti, endi] indicates that the ith clip started at starti and ended at endi.

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, time]. If the task is impossible, return -1.

Example 1:

Input: clips = [[0,2],[4,6],[8,10],[1,9],[1,5],[5,9]], time = 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]], time = 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]], time = 9
Output: 3
Explanation: We can take clips [0,4], [4,7], and [6,9].


Example 4:

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


# 2.思路

1、要用若干短视频凑出完成视频 [0, T]，至少得有一个短视频的起点是 0。

2、如果有几个短视频的起点都相同，那么一定应该选择那个最长（终点最大）的视频。

## 3.源码

【注意】有很多特殊case需考虑
[0,2 [4,8]
10
[0,6] …
5

class Solution {
public:
static bool cmp(vector<int> a,vector<int> b)
{
if(a[0]==b[0])
return a[1]>b[1];
else return a[0]<b[0];
}

int videoStitching(vector<vector<int>>& clips, int time)
{
sort(clips.begin(),clips.end(),cmp);
if(clips[0][0]>0) return -1;
int start=clips[0][1];
int ans=1;//从0开始算做一个片段

int maxend=clips[0][1];
int i=1;
//我们会比较所有起点小于 clips[0][1] 的区间，根据贪心策略，
//它们中终点最大的那个区间就是第二个会被选中的视频。
while((i<clips.size())&&(maxend<time)&&(ans<=clips.size()))
{
while((i<clips.size())&&(clips[i][0]<=start))
{
maxend=max(maxend,clips[i][1]);
i++;
}
ans++;
start=maxend;

}
if(maxend>=time)
{
return ans;
}
else return -1;
}
};

• 0
点赞
• 1
评论
• 0
收藏
• 一键三连
• 扫一扫，分享海报

06-19 7363

10-24 3万+
08-29 1万+
10-25 1万+
04-20 543