leetcode 567 滑动窗口

class Solution {
public:
    bool checkInclusion(string s1, string s2) {
        unordered_map<char,int> need,window;
        
        for(char i: s1)
        {
            need[i]++;
        }
        int left=0;
        int right=0;
        int 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 l=s2[left];
                left++;
                if(need.count(l))
                {
                    if(window[l]==need[l])
                    {
                        valid--;
                    }
                    window[l]--;
                }
            }
        }
        return false;
    }
};

每天进步一点点~
【推广】 免费学中医，健康全家人
原文地址：https://www.cnblogs.com/libin123/p/15175880.html