6.8. Метод двух указателей; Array traversal check, algorithm accelera…

…tion https://job4j.ru/profile/exercise/2/task-view/116
Temzor · Oct 5, 2023 · e8963a4 · e8963a4
1 parent 79b79b8
commit e8963a4
Showing 1 changed file with 5 additions and 2 deletions.
diff --git a/src/main/java/ru/j4j/array/TwoNumberSum.java b/src/main/java/ru/j4j/array/TwoNumberSum.java
@@ -6,14 +6,17 @@ public static int[] getIndexes(int[] array, int target) {
         int j = array.length - 1;
         while (i < j) {
             int sum = array[i] + array[j];
+            if (i > array.length / 2 || j < array.length / 2) {
+                break;
+            }
             if (sum == target) {
-                return new int[]{i, j};
+                return new int[] {i, j};
             } else if (sum < target) {
                 i++;
             } else {
                 j--;
             }
         }
-        return new int[]{};
+        return new int[] {};
     }
 }