LeetCode438. Find All Anagrams in a String

题目描述：

Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.

Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.

The order of output does not matter.

Example 1:

Input:
s: "cbaebabacd" p: "abc"

Output:
[0, 6]

Explanation:
The substring with start index = 0 is "cba", which is an anagram of "abc".
The substring with start index = 6 is "bac", which is an anagram of "abc".

Example 2:

Input:
s: "abab" p: "ab"

Output:
[0, 1, 2]

Explanation:
The substring with start index = 0 is "ab", which is an anagram of "ab".
The substring with start index = 1 is "ba", which is an anagram of "ab".
The substring with start index = 2 is "ab", which is an anagram of "ab".

解题思路： 

 采用字典的方式，令一个字母对应一个质数，一个字符串对应一组质数的乘积。采用滑窗的方式遍历字符串s，若某一个子字符串的乘积与p字符串的数字乘积不相等，则该子字符串一定不是p的变形。

Python代码：

class Solution:
    def findAnagrams(self, s: 'str', p: 'str') -> 'List[int]':
        if not s:
            return []
        temlist = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101]
        dic = {chr(x + 97): temlist[x] for x in range(26)}
        lp = len(p)
        num = 1
        vk = 1
        res = []
        for x in p:
            num *= dic[x]
        for x in s[0: lp]:
            vk *= dic[x]
        if vk == num:
            res.append(0)
        for i in range(1, len(s) - lp + 1):
            vk = vk // dic[s[i - 1]] * dic[s[i + lp - 1]] 
            if vk == num:
                res.append(i)        
        return res