//*********************************************************************** //* https://leetcode.com/problems/unique-morse-code-words/description/ //* //* 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. //* Given a string array 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. //* This program returns the number of different transformations among //* all words we have. //* //***********************************************************************
-
Notifications
You must be signed in to change notification settings - Fork 0
albertki/Unique-Morse-Code-Words
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Program returns the number of unique Morse code transformations among all words given in input
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published