1024. Video Stitching

最新推荐文章于 2024-04-08 09:41:57 发布

ForABiggerWorld

最新推荐文章于 2024-04-08 09:41:57 发布

阅读量1.3k

点赞数

分类专栏： leetcode greedy

本文链接：https://blog.csdn.net/zjucor/article/details/89157292

版权

这是一个关于体育赛事视频剪辑的问题，目标是最少使用多少个视频片段覆盖整个赛事。通过动态规划和贪心策略，可以实现有效解题。首先对视频片段按开始时间排序，然后选择能与已有片段连接的片段，并始终优先选择结束时间最大的片段，以达到最少片段数量。

摘要由CSDN通过智能技术生成

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 cu