【问题描述】
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.
String转换为char[], 对其排序后比较
public static boolean isAnagram(String s, String t) {
char[] sArr = s.toCharArray();
char[] tArr = t.toCharArray();
Arrays.sort(sArr);
Arrays.sort(tArr);
return String.valueOf(sArr).equals(String.valueOf(tArr));
}
【方法2——基于Map实现】
<span style="white-space:pre"> </span>public static boolean isAnagram2(String s, String t) {
if (s.equals(t)) {
return true;
}
if (s == null || t == null || s.length() != t.length()) {
return false;
}
HashMap<Character, Integer> sMap = new HashMap<Character, Integer>();
HashMap<Character, Integer> tMap = new HashMap<Character, Integer>();
for (int i = 0; i < s.length(); i++) {
if (sMap.containsKey(s.charAt(i))) {
sMap.put(s.charAt(i), sMap.get(s.charAt(i)) + 1);
} else {
sMap.put(s.charAt(i), 1);
}
if (tMap.containsKey(t.charAt(i))) {
tMap.put(t.charAt(i), tMap.get(t.charAt(i)) + 1);
} else {
tMap.put(t.charAt(i), 1);
}
}
for (Character key : sMap.keySet()) {
if (!tMap.containsKey(key) || !tMap.get(key).equals(sMap.get(key))) {
return false;
}
}
return true;
}