视频拼接

// Java Stream API solution for the problem
// The solution follows the same logic as above but utilizes Java Stream for sorting the clips.
// The rest of the logic remains the same: we sort the clips, iterate through them, and keep track of the farthest we can go with the current set of clips.

import java.util.Arrays;
import java.util.Comparator;

public class VideoStitchingStream {
    public int videoStitching(int[][] clips, int time) {
        // Sort clips using Stream
        int[][] sortedClips = Arrays.stream(clips)
            .sorted(Comparator.comparingInt((int[] a) -> a[0]).thenComparingInt(a -> -a[1]))
            .toArray(int[][]::new);
        int end = 0, farthest = 0, count = 0;
        int i = 0;
        while (i < sortedClips.length && end < time) {
            while (i < sortedClips.length && sortedClips[i][0] <= end) {
                farthest = Math.max(farthest, sortedClips[i][1]);
                i++;
            }
            if (end == farthest) return -1; // Can't move forward
            end = farthest;
            count++;
        }
        return end >= time ? count : -1;
    }
}