class Solution {
public int minimumDifference(int[] nums, int k) {
Arrays.sort(nums);
int ans = Integer.MAX_VALUE;
for(int i = 0; i + k - 1 < nums.length;i++){
ans = Math.min(ans,nums[i + k -1] - nums[i]);
}
return ans;
}
}
注意点:
滑动窗口 i+k-1 - i