forked from kdn251/interviews
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUniqueWordAbbreviation.java
More file actions
70 lines (51 loc) · 1.86 KB
/
UniqueWordAbbreviation.java
File metadata and controls
70 lines (51 loc) · 1.86 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
65
66
67
68
69
70
// An abbreviation of a word follows the form <first letter><number><last letter>. Below are some examples of word abbreviations:
// a) it --> it (no abbreviation)
// 1
// b) d|o|g --> d1g
// 1 1 1
// 1---5----0----5--8
// c) i|nternationalizatio|n --> i18n
// 1
// 1---5----0
// d) l|ocalizatio|n --> l10n
// Assume you have a dictionary and given a word, find whether its abbreviation is unique in the dictionary. A word's abbreviation is unique if no other word from the dictionary has the same abbreviation.
// Example:
// Given dictionary = [ "deer", "door", "cake", "card" ]
// isUnique("dear") ->
// false
// isUnique("cart") ->
// true
// isUnique("cane") ->
// false
// isUnique("make") ->
// true
import java.util.ArrayList;
public class UniqueWordAbbreviation {
HashMap<String, String> map;
public ValidWordAbbr(String[] dictionary) {
this.map = new HashMap<String, String>();
for(String word : dictionary) {
String key = getKey(word);
if(map.containsKey(key)) {
if(!map.get(key).equals(word)) {
map.put(key, "");
}
} else {
map.put(key, word);
}
}
}
public boolean isUnique(String word) {
return !map.containsKey(getKey(word))||map.get(getKey(word)).equals(word);
}
public String getKey(String word) {
if(word.length() <= 2) {
return word;
}
return word.charAt(0) + Integer.toString(word.length() - 2) + word.charAt(word.length() - 1);
}
}
// Your ValidWordAbbr object will be instantiated and called as such:
// ValidWordAbbr vwa = new ValidWordAbbr(dictionary);
// vwa.isUnique("Word");
// vwa.isUnique("anotherWord");