Given two strings s and t,write a function to determine if t is an anagram of s.
For example,
s = "anagram", t ="nagaram", return true.
s = "rat", t ="car", return false.
Note:
You may assume the stringcontains only lowercase alphabets.
题目也是醉了,完全没看懂。唯一有意义的是字符串全部包含小写字母。题目的意思是两个字符串包含的字符的是否完全一致(不要求顺序一样)。题目不难,代码如下:
public class Solution {
public boolean isAnagram(String s, Stringt) {
if(s.length()==0&&t.length()==0){
return true;
}
if(s.length()==0||t.length()==0){
return false;
}
if(s.length()!=t.length()){
return false;
}
int []a=new int[26];
int []b=new int[26];
for(int i=0;i<s.length();i++){
a[s.charAt(i)-'a']++;
b[t.charAt(i)-'a']++;
}
for(int i=0;i<26;i++){
if(a[i]!=b[i]){
return false;
}
}
return true;
}
}