Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static Pair search(int[] arr) {
- if (arr.length == 0)
- return null;
- if (arr.length == 1)
- return new Pair(arr[0], arr[0]);
- int max = arr[0];
- int min = arr[0];
- for (int i = 0; i < arr.length - 2; i += 2) {
- int local_min = arr[i];
- int local_max = arr[i + 1];
- if (local_max < local_min) {
- int temp = local_max;
- local_max = local_min;
- local_min = temp;
- }
- if (local_min < min)
- min = local_min;
- if (local_max > max)
- max = local_max;
- }
- if (ARRAY_LENGTH % 2 != 0) {
- min = (arr[ARRAY_LENGTH - 1] < min) ? arr[ARRAY_LENGTH - 1] : min;
- max = (arr[ARRAY_LENGTH - 1] > max) ? arr[ARRAY_LENGTH - 1] : max;
- }
- return new Pair(max, min);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement