Update code

Author: xuyang471

src/main/java/com/thealgorithms/scheduling/diskscheduling/CircularLookScheduling.java

@@ -48,27 +48,18 @@ public List<Integer> execute(List<Integer> requests) {
 
         if (movingUp) {
             // Process all requests in the upward direction
-            for (int request : upRequests) {
-                result.add(request);
-            }
+            result.addAll(upRequests);
 
             // Jump to the lowest request and process all requests in the downward direction
-            if (!downRequests.isEmpty()) {
-                result.addAll(downRequests);
-            }
+            result.addAll(downRequests);
         } else {
             // Process all requests in the downward direction (in reverse order)
-            for (int i = downRequests.size() - 1; i >= 0; i--) {
-                result.add(downRequests.get(i));
-            }
+            Collections.reverse(downRequests);
+            result.addAll(downRequests);
 
             // Jump to the highest request and process all requests in the upward direction (in reverse order)
-            if (!upRequests.isEmpty()) {
-                for (int i = upRequests.size() - 1; i >= 0; i--) {
-                    result.add(upRequests.get(i));
-                }
-            }
-
+            Collections.reverse(upRequests);
+            result.addAll(upRequests);
         }
 
         // Update current position to the last processed request

src/test/java/com/thealgorithms/scheduling/diskscheduling/CircularLookSchedulingTest.java

@@ -4,7 +4,6 @@
 
 import java.util.Arrays;
 import java.util.List;
-
 import org.junit.jupiter.api.Test;
 
 public class CircularLookSchedulingTest {

src/test/java/com/thealgorithms/scheduling/diskscheduling/CircularScanSchedulingTest.java

@@ -4,7 +4,6 @@
 
 import java.util.Arrays;
 import java.util.List;
-
 import org.junit.jupiter.api.Test;
 
 public class CircularScanSchedulingTest {

src/test/java/com/thealgorithms/scheduling/diskscheduling/LookSchedulingTest.java

@@ -4,7 +4,6 @@
 
 import java.util.Arrays;
 import java.util.List;
-
 import org.junit.jupiter.api.Test;
 
 public class LookSchedulingTest {

src/test/java/com/thealgorithms/scheduling/diskscheduling/SSFSchedulingTest.java

@@ -5,7 +5,6 @@
 
 import java.util.ArrayList;
 import java.util.List;
-
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
 
@@ -53,4 +52,5 @@ public void testGetCurrentPositionAfterExecution() {
         int currentPosition = scheduler.getCurrentPosition();
         assertEquals(10, currentPosition, "Current position should be the last request after execution.");
     }
+
  }

src/test/java/com/thealgorithms/scheduling/diskscheduling/ScanSchedulingTest.java

@@ -4,7 +4,6 @@
 
 import java.util.Arrays;
 import java.util.List;
-
 import org.junit.jupiter.api.Test;
 
 public class ScanSchedulingTest {
@@ -53,4 +52,3 @@ public void testScanScheduling() {
         System.out.println("Request Order: " + result);
     }
 }
-