五月集训day6滑动窗口

1984
排序后遍历；

int cmp(const void* a,const void* b)
{
    return *(int *)a - *(int *)b;
}
int minimumDifference(int* nums, int numsSize, int k){
    if (k == 1)
        return 0;
    int min = 1e5 + 1;
    qsort(nums,numsSize,sizeof(int),cmp);
    for (int i = 0,j = k - 1;j < numsSize;i++,j++)
    {
        if (min > nums[j] - nums[i])
            min = nums[j] - nums[i];
    }
    return min;
}

1876
不明白为什么哈希表一直卡，明天再写。

int countGoodSubstrings(char * s){
    int sum = 0;
    int n = strlen(s);
    for (int i = 0; i < n - 2; ++i){
        if (s[i] != s[i+1] && s[i] != s[i+2] && s[i+1] != s[i+2]){
            ++sum;
        }
    }
    return sum;
}