Improved task 1024.

Author: javadev

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

@@ -10,8 +10,9 @@ public int videoStitching(int[][] clips, int time) {
         int count = 0;
         int covered = 0;
         for (int i = 0, start = 0; start < time; count++, start = covered) {
-            for (; i < clips.length && clips[i][0] <= start; i++) {
+            while (i < clips.length && clips[i][0] <= start) {
                 covered = Math.max(covered, clips[i][1]);
+                i++;
             }
             if (start == covered) {
                 return -1;