leetcode滑动窗口模板之字符串的排列567

滑动窗口

public boolean checkInclusion(String s1, String s2) {
        if (s1.length()>s2.length()) return false;
        char[] s1Arr=s1.toCharArray();
        char[] s2Arr=s2.toCharArray();
        int[] hash=new int[128];
        for (char c:s1Arr) hash[c]++;
        int l=0,len=s1Arr.length,count=0;
        boolean results=false;
        for (int r=0;r<s2Arr.length;r++){
            hash[s2Arr[r]]--;
            if (hash[s2Arr[r]]>=0) count++;
            if (r>len-1){
                hash[s2Arr[l]]++;
                if (hash[s2Arr[l]]>0) count--;
                l++;
            }
            if (count==len) {return true;}
        }
        return false;
    }

请参考滑动窗口模板！！！