Repository navigation
Expand file tree
/
Copy pathGroupAnagram.java
More file actions
64 lines (55 loc) · 1.81 KB
/
Copy pathGroupAnagram.java
File metadata and controls
64 lines (55 loc) · 1.81 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
import java.util.*;
/**
* 判断是否是异形词，并分组
*/
public class GroupAnagram {
public static List<List<String>> groupAnagrams(String[] strs) {
if (strs == null || strs.length == 0)
return new ArrayList<>();
Map<String, List<String>> map = new HashMap<>();
for (String s : strs) {
char[] ca = new char[26];
//统计字符串中每个字符串出现的次数
for (char c : s.toCharArray())
ca[c - 'a']++;
//统计每个字符出现次数的数组转化为字符串
String keyStr = String.valueOf(ca);
if (!map.containsKey(keyStr))
map.put(keyStr, new ArrayList<>());
map.get(keyStr).add(s);
}
return new ArrayList<>(map.values());
}
public static boolean isAnagram2(String s, String t) {
if (s.equals(t))
return true;
if (s.length() != t.length()) {
return false;
}
var map = new HashMap<Character,Integer>();
//统计s的词频
for (int i = 0; i < s.length(); i++) {
Character cs = s.charAt(i);
if (!map.containsKey(cs)) {
map.put(cs,1);
}
else {
map.put(cs, map.get(cs) + 1);
}
}
for (int i = 0; i < t.length(); i++) {
Character ct = t.charAt(i);
if (!map.containsKey(ct))
return false;
else
map.put(ct,map.get(ct) - 1);
if (map.get(ct) < 0)
return false;
}
return true;
}
public static void main(String[] args) {
String[] strings = {"eat", "tea", "tan", "ate", "nat", "bat"};
System.out.println(groupAnagrams(strings));
}
}