Minimum Difference Between Highest and Lowest of K Scores LeetCode solution in Java

1
class Solution {
2
  public int minimumDifference(int[] nums, int k) {
3
    if (k == 1) return 0;
4
    int i = 0, j = k - 1, res = Integer.MAX_VALUE;
5

6
    Arrays.sort(nums);
7
    while (j < nums.length) {
8
      res = Math.min(res, nums[j] - nums[i]);
9
      j++;
10
      i++;
11
    }
12

13
    return res;
14
  }
15
}