class Solution {
public boolean isAnagram_1(String s, String t) {
char[] sChars = s.toCharArray();
char[] tChars = t.toCharArray();
Arrays.sort(sChars);
Arrays.sort(tChars);
return String.valueOf(sChars).equals(String.valueOf(tChars));
}
public boolean isAnagram_2(String s, String t) {
Map<Character, Integer> map = new HashMap<>();
for (char ch : s.toCharArray()) {
map.put(ch, map.getOrDefault(ch, 0) + 1);
}
for (char ch : t.toCharArray()) {
Integer count = map.get(ch);
if (count == null) {
return false;
} else if (count > 1) {
map.put(ch, count - 1);
} else {
map.remove(ch);
}
}
return map.isEmpty();
}
public boolean isAnagram(String s, String t) {
int[] sCounts = new int[26];
int[] tCounts = new int[26];
for (char ch : s.toCharArray()) {
sCounts[ch - 'a']++;
}
for (char ch : t.toCharArray()) {
tCounts[ch - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (sCounts[i] != tCounts[i]) {
return false;
}
}
return true;
}
}
给定两个字符串 s 和 t ,编写一个函数来判断 t 是否是 s 的字母异位词。
题目:https://leetcode-cn.com/problems/valid-anagram/
示例 1:
输入: s = "anagram", t = "nagaram"
输出: true
示例 2:
输入: s = "rat", t = "car"
输出: false
三种解法均是直接copy的
458

被折叠的 条评论
为什么被折叠?



