Improved task 1024.

Author: javadev

src/main/java/g1001_1100/s1024_video_stitching/Solution.java

@@ -9,14 +9,18 @@ public int videoStitching(int[][] clips, int time) {
         Arrays.sort(clips, (a, b) -> a[0] == b[0] ? a[1] - b[1] : a[0] - b[0]);
         int count = 0;
         int covered = 0;
-        for (int i = 0, start = 0; start < time; count++, start = covered) {
+        int i = 0;
+        int start = 0;
+        while (start < time) {
             while (i < clips.length && clips[i][0] <= start) {
                 covered = Math.max(covered, clips[i][1]);
                 i++;
             }
             if (start == covered) {
                 return -1;
             }
+            count++;
+            start = covered;
         }
         return count;
     }