LintCode 1639: K-Substring wth K different characters

原题如下：
1639. K-Substring with K different characters
Given a string S and an integer K.
Calculate the number of substrings of length K and containing K different characters

Example
String: “abcabc”
K: 3

Answer: 3
substrings: [“abc”, “bca”, “cab”]
String: “abacab”
K: 3

Answer: 2
substrings: [“bac”, “cab”]

解法1：用到了deque, map和set，效率非常低。

class Solution {
public:
    /**
     * @param stringIn: The original string.
     * @param K: The length of substrings.
     * @return: return the count of substring of length K and exactly K distinct characters.
     */
    int KSubstring(string &stringIn, int K) {
        deque<char> dq;
        map<char, int> mp;   //char, count
        set<deque<char>> s;
        int len = stringIn.size();

        for (int i = 0; i < len; ++i) {
            if (dq.size() == K) {
                char c = dq.front();
                dq.pop_front();
                if (mp[c] == 1)
                    mp.erase(c);
                else 
                    mp[c]--;
            }    
            
            dq.push_back(stringIn[i]);   
            if (mp.find(stringIn[i]) == mp.end())
                mp[stringIn[i]] = 1;
            else
                mp[stringIn[i]]++;

            if ((dq.size() == K) && (mp.size() == K)) {
                s.insert(dq);
            }
        }
        
        return s.size();
    }
};