滑动窗口--------字符串的排列

class Solution {

public:

    bool checkInclusion(string s1, string s2) {

        unordered_map<char,int> need,window;

        for(int i = 0;i < s1.size();i++){

            char c = s1[i];

            need[c]++;

        }

        int right = 0,left = 0,valid = 0;

        while(right < s2.size())

        {

            char c = s2[right];

            right++;

            if(need.count(c)){

                window[c]++;

                if(window[c] == need[c]){

                    valid++;

                }

            }

            while(right - left >= s1.size()){

                if(valid == need.size()){

                    return true;

                }

                char d = s2[left];

                left++;

                if(need.count(d)){

                  if(window[d] == need[d]){

                      valid--;

                  }

                  window[d]--;

                }

            }

        }

        return false;

    }

};