leetcode/problems/0804-go/main.go at main · emfomy/leetcode · GitHub

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
// Source: https://leetcode.com/problems/unique-morse-code-words
// Title: Unique Morse Code Words
// Difficulty: Easy
// Author: Mu Yang <http://muyang.pro>

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:
//
//   'a' maps to ".-",
//   'b' maps to "-...",
//   'c' maps to "-.-.", and so on.
//
// For convenience, the full table for the 26 letters of the English alphabet is given below:
//
//   [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
//
// Given an array of strings words where each word can be written as a concatenation of the Morse code of each letter.
//
//   For example, "cab" can be written as "-.-..--...", which is the concatenation of "-.-.", ".-", and "-...". We will call such a concatenation the transformation of a word.
//
// Return the number of different transformations among all words we have.
//
// Example 1:
//
//   Input: words = ["gin","zen","gig","msg"]
//   Output: 2
//   Explanation: The transformation of each word is:
//     "gin" -> "--...-."
//     "zen" -> "--...-."
//     "gig" -> "--...--."
//     "msg" -> "--...--."
//     There are 2 different transformations: "--...-." and "--...--.".
//
// Example 2:
//
//   Input: words = ["a"]
//   Output: 1
//
// Constraints:
//
//   1 <= words.length <= 100
//   1 <= words[i].length <= 12
//   words[i] consists of lowercase English letters.
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

package main

type void struct{}

func uniqueMorseRepresentations(words []string) int {
	trans := make(map[string]void, len(words))
	morseMap := []string{".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."}

	for _, word := range words {
		morse := ""
		for _, c := range word {
			morse += morseMap[c-'a']
		}
		trans[morse] = void{}
	}

	return len(trans)
}