forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathUniqueWordAbbreviation.java
62 lines (55 loc) · 2.11 KB
/
UniqueWordAbbreviation.java
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
package easy;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
public class UniqueWordAbbreviation {
private class ValidWordAbbr {
private Map<String, String> dict;
public ValidWordAbbr(String[] dictionary) {
dict = new HashMap();
for(String word : dictionary){
String key = word.length() <= 2 ? word : (word.charAt(0) + String.valueOf(word.length()-2) + word.charAt(word.length()-1));
if(dict.containsKey(key) && !dict.get(key).equals(word)){
dict.put(key, "");
} else {
dict.put(key, word);
}
}
}
public boolean isUnique(String word) {
String key = word.length() <= 2 ? word : (word.charAt(0) + String.valueOf(word.length()-2) + word.charAt(word.length()-1));
if(!dict.containsKey(key)) return true;
else return dict.get(key) != "" && dict.get(key).equals(word);
}
}
}
class ValidWordAbbr {
private Map<String, Set<String>> dict;
public ValidWordAbbr(String[] dictionary) {
dict = new HashMap();
for(String word : dictionary){
String key = word.length() <= 2 ? word : (word.charAt(0) + String.valueOf(word.length()-2) + word.charAt(word.length()-1));
if(dict.containsKey(key)){
Set<String> set = dict.get(key);
set.add(word);
dict.put(key, set);
} else {
Set<String> set = new HashSet();
set.add(word);
dict.put(key, set);
}
}
}
public boolean isUnique(String word) {
String key = word.length() <= 2 ? word : (word.charAt(0) + String.valueOf(word.length()-2) + word.charAt(word.length()-1));
if(!dict.containsKey(key)) return true;
else {
Set<String> set = dict.get(key);
if(set.size() != 1) return false;
Iterator<String> it = set.iterator();
return it.next().equals(word);
}
}
}