public static Pair<Integer, Integer> getMinimumAndMaximum(int[] inputArray) {
int minimum;
int maximum;
if (inputArray == null || inputArray.length == 0) {
return new Pair<Integer, Integer>(null, null);
}
for(int i = 1; i < inputArray.length; i++){
if (inputArray[i] > inputArray[0]){ maximum = inputArray [i]; }
else if(inputArray[i] < inputArray[0]){ minimum = inputArray [i]; }
}
return new Pair<Integer, Integer>(minimum, maximum);
}package com.javarush.task.task11.task1123;
public class Solution {
public static void main(String[] args) {
int[] data = new int[]{1, 2, 3, 5, -2, -8, 0, 77, 5, 5};
Pair<Integer, Integer> result = getMinimumAndMaximum(data);
System.out.println("The minimum is " + result.x);
System.out.println("The maximum is " + result.y);
}
public static Pair<Integer, Integer> getMinimumAndMaximum(int[] inputArray) {
int minimum;
int maximum;
if (inputArray == null || inputArray.length == 0) {
return new Pair<Integer, Integer>(null, null);
}
for(int i = 1; i < inputArray.length; i++){
if (inputArray[i] > inputArray[0]){ maximum = inputArray [i]; }
else if(inputArray[i] < inputArray[0]){ minimum = inputArray [i]; }
}
return new Pair<Integer, Integer>(minimum, maximum);
}
public static class Pair<X, Y> {
public X x;
public Y y;
public Pair(X x, Y y) {
this.x = x;
this.y = y;
}
}
}