-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathString804.java
More file actions
75 lines (70 loc) · 2.64 KB
/
String804.java
File metadata and controls
75 lines (70 loc) · 2.64 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
71
72
73
74
75
package string;
import java.util.HashSet;
import java.util.Set;
/**
* @ProjectName: leetcode
* @Package: string
* @ClassName: String804
* @Author: markey
* @Description:
* 国际摩尔斯密码定义一种标准编码方式，将每个字母对应于一个由一系列点和短线组成的字符串， 比如: "a" 对应 ".-", "b" 对应 "-...", "c" 对应 "-.-.", 等等。
*
* 为了方便，所有26个英文字母对应摩尔斯密码表如下：
*
* [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
* 给定一个单词列表，每个单词可以写成每个字母对应摩尔斯密码的组合。例如，"cab" 可以写成 "-.-..--..."，(即 "-.-." + "-..." + ".-"字符串的结合)。我们将这样一个连接过程称作单词翻译。
*
* 返回我们可以获得所有词不同单词翻译的数量。
*
* 例如:
* 输入: words = ["gin", "zen", "gig", "msg"]
* 输出: 2
* 解释:
* 各单词翻译如下:
* "gin" -> "--...-."
* "zen" -> "--...-."
* "gig" -> "--...--."
* "msg" -> "--...--."
*
* 共有 2 种不同翻译, "--...-." 和 "--...--.".
*
*
* 注意:
*
* 单词列表words 的长度不会超过 100。
* 每个单词 words[i]的长度范围为 [1, 12]。
* 每个单词 words[i]只包含小写字母。
*
* 来源：力扣（LeetCode）
* 链接：https://leetcode-cn.com/problems/unique-morse-code-words
* 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
* @Date: 2019/10/6 18:16
* @Version: 1.0
*/
public class String804 {
public static void main(String[] args) {
String[] words = {"gin", "zen", "gig", "msg"};
System.out.println(uniqueMorseRepresentations(words));
}
/**
* 利用set不存在重复元素
* 执行用时 :2 ms, 在所有 Java 提交中击败了99.94%的用户
* 内存消耗 :35.5 MB, 在所有 Java 提交中击败了83.71%的用户
* @param words
* @return
*/
public static int uniqueMorseRepresentations(String[] words) {
String[] dist = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.",
"---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
Set<String> result = new HashSet<>();
StringBuilder sb = new StringBuilder();
for (String s: words) {
for (char c: s.toCharArray()) {
sb.append(dist[c - 'a']);
}
result.add(sb.toString());
sb.delete(0, sb.length());
}
return result.size();
}
}