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 string contains only lowercase alphabets.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
public class Solution {
public boolean isAnagram(String s, String t) {
int[] c = new int[26];
for(int i=0;i<s.length();i++){
c[s.charAt(i) - 'a']++;
}
for(int i=0;i<t.length();i++) {
c[t.charAt(i) - 'a']--;
}
System.out.println(c.length);
for(int i=0;i<c.length;i++){
if(c[i] !=0){
return false;
}
}
return true;
}
}
本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注：
