11.7 Finding MIN MAX simultaneously. Isn't this a better way ?

[Abhilash-Mandlekar]

This solution passes all the test cases. It has O(N) time and O(1) space. I wonder if this is more readable solution:

`public static MinMax findMinMax(List A) {
Integer min = Integer.MAX_VALUE;
Integer max = Integer.MIN_VALUE;

for(int n: A){
  if(n<min)
    min = n;
  
  if(n>max)
    max = n;
}
return new MinMax(min, max);

}`

(I was asked this question in an interview and solved this way)