【leetcode题解】leetcode 1024 Video Stitching

最新推荐文章于 2022-10-18 23:23:04 发布

空壳789

最新推荐文章于 2022-10-18 23:23:04 发布

阅读量970

点赞数

本文链接：https://blog.csdn.net/cenwm/article/details/89085238

版权

这篇博客介绍了如何解决LeetCode上的1024题，即Video Stitching问题。通过排序区间并使用动态规划方法找到能覆盖整个体育赛事[0, T]的最少区间数。当无法覆盖时返回-1。博主提供了状态转移方程以及高效C++代码实现。" 128768847,1291052,MATLAB深度学习：无线通信下的人脸识别系统实现,"['MATLAB教程', '深度学习网络', '人脸识别', '无线通信', '图像识别']

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

【传送门】https://leetcode.com/problems/video-stitching/

【原题描述】
1024. Video Stitching
Medium

Favorite

Share
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],