Approach

# 排序後找用sliding window找最小差值

Time Complexity

O(nlogn)

Space Complexity

O(nlogn)

Code

class Solution {
public:
    int minimumDifference(vector<int>& nums, int k) {
        int ans = 100010;

        sort(nums.begin(), nums.end());


        for (int i = k - 1 ; i < nums.size() ; i++) {
            ans = min(ans, nums[i] - nums[i - k + 1]) ;
        }

        if (k == 1) {
            return 0;
        }
        else {
            return ans;
        }
    }
};