【Lintcode】1639. K-Substring with K Different Characters

题目地址：

https://www.lintcode.com/problem/k-substring-with-k-different-characters/description

给定一个长$n$字符串$s$，和一个正整数$k$，找到$s$中所有长度为$k$并且无重复字母的子串（相等的子串只算一个）。返回这样的子串个数。

参考https://blog.csdn.net/qq_46105170/article/details/113456330。代码如下：

import java.util.HashSet;
import java.util.Set;

public class Solution {
    /**
     * @param str: The original string.
     * @param k:   The length of substrings.
     * @return: return the count of substring of length K and exactly K distinct characters.
     */
    public int KSubstring(String str, int k) {
        // Write your code here
        if (k > str.length()) {
            return 0;
        }
        
        long p = 131, hash = 0, pow = 1;
        int[] count = new int[256];
        for (int i = 0; i < k; i++) {
            count[str.charAt(i)]++;
            pow *= p;
            hash = hash * p + str.charAt(i);
        }
        
        Set<Long> set = new HashSet<>();
        if (check(count)) {
            set.add(hash);
        }
        
        for (int i = k; i < str.length(); i++) {
            hash = hash * p + str.charAt(i);
            hash -= str.charAt(i - k) * pow;
            
            count[str.charAt(i)]++;
            count[str.charAt(i - k)]--;
            
            if (check(count)) {
                set.add(hash);
            }
        }
        
        return set.size();
    }
    
    private boolean check(int[] count) {
        for (int i = 0; i < 256; i++) {
            if (count[i] > 1) {
                return false;
            }
        }
        
        return true;
    }
}

时间复杂度$O(n)$，空间$O(n-k)$。