criskgl
8/15/2019 - 9:10 PM

Max Min minimum difference array of k elements

Given an array A of n elements

Build an array of length k with elements taken from A

Such that the difference between the highsest and lowest elements are minimum.

minMax.java
content_copyfile_download

static int maxMin(int k, int[] arr) {
  Arrays.sort(arr);
  int minDif = Integer.MAX_VALUE;
  for(int i = 0; i < arr.length; i++){
      if(i + k - 1> arr.length - 1) break;
      if(arr[i + k - 1] - arr[i] < minDif) minDif = arr[i + k - 1] - arr[i];
  }   
  return minDif;
}