力扣算法之《438. 找到字符串中所有字母异位词》

力扣算法之《438. 找到字符串中所有字母异位词》（附：第一次遇上滑块问题，参照官网解决方法手打代码 😦）

class Solution {
    public List<Integer> findAnagrams(String s, String p) {
        // type the following code follow the solution of official website of Likou 
        if(s.length() < p.length())return new ArrayList<Integer>();
        List<Integer> ans = new ArrayList<Integer>();
        int slen = s.length(), plen = p.length();
        int []ss = new int[26];
        int []pp = new int[26];
        
        // initial ss and pp
        for(int i=0; i < plen; ++i){
            ss[s.charAt(i) - 'a']++;
            pp[p.charAt(i) - 'a']++;
        }
        if(Arrays.equals(ss, pp)){
            ans.add(0);
        }
        
        // start to slide
        for(int i = 0; i < slen - plen; ++i){
            ss[s.charAt(i) - 'a']--; // recover the front state
            ss[s.charAt(i+plen) - 'a']++; // update the next state
            // slide success
            if(Arrays.equals(ss, pp)){
                ans.add(i+1);
            }
        }
        
        return ans;
        // type the following code follow the solution of official website of Likou 
    }
}

小白一枚，请各位大佬指教 😃!!!