Leetcode——438. Find All Anagrams in a String

题目原址

https://leetcode.com/problems/find-all-anagrams-in-a-string/description/

题目描述

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.

Examole1：

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”.

Example2：

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中的字符可以任意打乱顺序，找到s串中包含p串的子串的所有起始位置。

看了很多其他人的AC代码，但是都感觉不太好理解，大多都是使用数组来实现的，不得不说数组实现的效率会高一些。

• 定义一个方法，该方法用来计算字符串p中元素的ASCII码的乘积，因为如果是使用相加的方法，可能会出现a+d = c + b这种不靠谱的情况。
• 定义一个List类型的变量，用来存储返回的值。
• 如果p的长度大于s的长度，则直接返回ret。
• 通过for循环来判断字符串s中包含p的子串。这里需要进行边界值的判定if(i + p.length() > s.length() )
• 如果p的所有元素的乘机等于s的子串的乘积，则将s子串的头位置放在集合中。

AC代码

class Solution {
    public List<Integer> findAnagrams(String s, String p) {
        List<Integer> ret = new ArrayList<Integer>();
        if(p.length() > s.length())
            return ret;
        int length = p.length();
        int Mutiply = getMu(p);
        for(int i = 0; i < s.length(); i++) {
            if(i + p.length() > s.length() )
                break;
            if(Mutiply == getMu(s.substring(i, i + length)))
                ret.add(i);
        }
        return ret;
    }

    public int getMu(String p) {
        int ret = 1;
        for(char c: p.toCharArray()) {
            ret *= (int)c;
        }
        return ret;
    }
}