Minimum Difference Between Highest and Lowest of K Scores

给一个数组和一个数字k, 求k个数字的最大最小值的差最小.

class Solution {
    public int minimumDifference(int[] nums, int k) {
        Arrays.sort(nums);
        int min = Integer.MAX_VALUE;
        if(k == 1)
            return 0;
        for(int i = k - 1; i < nums.length; i++)
        {
            min = Math.min(min, nums[i] - nums[i - k + 1]);
        }
        return min;
    }
}