题目描述:
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”.
虽然是简单题,但是可耻的没做出来(其实写出了一个方法,但是超时了)
一个正确的解法就直接给代码了,很好理解, 注意的是代码里用到了后减 的运算,这个非常巧妙,保证了先判断再操作,然后还有一个学习到了的是Arrays.copyOf(int[])的方法,由于int[]是一个对象,直接a=b只是reference改变,实际指的还是一个东西,所以用到了这个function,得到了一个int[] 的副本。 还有一个就是对于char类型的问题,其实没必要去用hashmap,因为char实际上就是0-255的数字,初始化一个int[]来保存就好,有两种方法初始化它:1. int[] a= new int[256]; 2. int[]a=new int[26]。 用第二种方法的时候记得减去char‘a’,比如 a[‘b’-‘a’]++;
public class Solution {
public List<Integer> findAnagrams(String s, String p) {
List<Integer>l=new ArrayList<Integer>();
int []hash=new int[26];
for(int i=0;i<p.length();i++){
hash[p.charAt(i)-'a']++;
}
boolean addornot=true;
int []temp;
for(int i=0;i<=s.length()-p.length();i++){
addornot=true;
temp=Arrays.copyOf(hash,hash.length);
for(int j=i;j<i+p.length();j++){
if(temp[s.charAt(j)-'a' ]--<=0){
addornot=false;
break;}
}
if(addornot)l.add(i);
}
return l;
}
}