下面是我的实现算法:
public class Solution {
public boolean isAnagram(String s, String t) {
char[] array1 = s.toCharArray();
char[] array2 = t.toCharArray();
int j = 0;
for(int i=0;i<array2.length;i++){
char temp2 = array2[i];
for(;j<array1.length;j++){
char temp1 = array1[j];
if(temp1 == temp2){
if(i==array2.length-1){
return true;
}
i++;
temp2 = array2[i];
}else{
i = -1;
}
}
}
return false;
}
}