问题：
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:
[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
Now, given a list of words, 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 "-.-." + "-..." + ".-"). We'll call such a concatenation, the transformation of a word.
方法：
将字符串组中的字符串转换成morse电码并存入set中，最后输出set中元素的个数即为结果。（set不保存重复元素）
具体实现：
class UniqueMorseCodeWords {
private val morse = arrayOf(".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--..")
fun uniqueMorseRepresentations(words: Array<String>): Int {
val mutableSet = words
.map { trans(it) }
.toSet()
return mutableSet.size
}
private fun trans(str : String): String {
val sb = StringBuilder()
for (ch in str) {
sb.append(morse[ch.toInt() % 'a'.toInt()])
}
return sb.toString()
}
}
fun main(args: Array<String>) {
val words = arrayOf("gin", "zen", "gig", "msg")
val uniqueMorseCodeWords = UniqueMorseCodeWords()
println(uniqueMorseCodeWords.uniqueMorseRepresentations(words))
}
有问题随时沟通
