{"id":2377,"date":"2018-03-24T19:56:48","date_gmt":"2018-03-25T02:56:48","guid":{"rendered":"http:\/\/zxi.mytechroad.com\/blog\/?p=2377"},"modified":"2018-03-24T20:02:11","modified_gmt":"2018-03-25T03:02:11","slug":"leetcode-804-unique-morse-code-words","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/string\/leetcode-804-unique-morse-code-words\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 804. Unique Morse Code Words"},"content":{"rendered":"

Problem<\/strong><\/h1>\n

\u9898\u76ee\u5927\u610f\uff1a\u7ed9\u4f60\u4e00\u4e9b\u5355\u8bcd\uff0c\u95ee\u8fd9\u4e9b\u5355\u8bcd\u7684\u83ab\u65af\u5bc6\u7801\u5171\u6709\u51e0\u79cd\u5f62\u5f0f\u3002<\/p>\n

International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:\u00a0\"a\"<\/code>\u00a0maps to\u00a0\".-\"<\/code>,\u00a0\"b\"<\/code>\u00a0maps to\u00a0\"-...\"<\/code>,\u00a0\"c\"<\/code>\u00a0maps to\u00a0\"-.-.\"<\/code>, and so on.<\/p>\n

For convenience, the full table for the 26 letters of the English alphabet is given below:<\/p>\n

[\".-\",\"-...\",\"-.-.\",\"-..\",\".\",\"..-.\",\"--.\",\"....\",\"..\",\".---\",\"-.-\",\".-..\",\"--\",\"-.\",\"---\",\".--.\",\"--.-\",\".-.\",\"...\",\"-\",\"..-\",\"...-\",\".--\",\"-..-\",\"-.--\",\"--..\"]<\/pre>\n
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\u00a0of a word.<\/p>\n
Return the number of different transformations among all words we have.<\/p>\n
Example:<\/strong>\r\nInput:<\/strong> words = [\"gin\", \"zen\", \"gig\", \"msg\"]\r\nOutput:<\/strong> 2\r\nExplanation: <\/strong>\r\nThe transformation of each word is:\r\n\"gin\" -> \"--...-.\"\r\n\"zen\" -> \"--...-.\"\r\n\"gig\" -> \"--...--.\"\r\n\"msg\" -> \"--...--.\"\r\n\r\nThere are 2 different transformations, \"--...-.\" and \"--...--.\".\r\n<\/pre>\n
 <\/p>\n
Note:<\/strong><\/p>\n
    \n
  • The length of\u00a0words<\/code>\u00a0will be at most\u00a0100<\/code>.<\/li>\n
  • Each\u00a0words[i]<\/code>\u00a0will have length in range\u00a0[1, 12]<\/code>.<\/li>\n
  • words[i]<\/code>\u00a0will only consist of lowercase letters.<\/li>\n<\/ul>\n
    Solution: HashTable<\/strong><\/h1>\n
    Time Complexity: O(n)<\/p>\n
    Space Complexity: O(n)<\/p>\n
    C++<\/p>\n
    \/\/ Author: Huahua\r\nclass Solution {\r\npublic:\r\n  int uniqueMorseRepresentations(vector<string>& words) {\r\n    vector<string> m{\".-\",\"-...\",\"-.-.\",\"-..\",\".\",\"..-.\",\"--.\",\"....\",\"..\",\".---\",\"-.-\",\".-..\",\"--\",\"-.\",\"---\",\".--.\",\"--.-\",\".-.\",\"...\",\"-\",\"..-\",\"...-\",\".--\",\"-..-\",\"-.--\",\"--..\"};\r\n    unordered_set<string> s;\r\n    for (const string& word : words) {\r\n      string code;\r\n      for (char c : word)\r\n        code += m[c - 'a'];\r\n      s.insert(code);\r\n    }\r\n    return s.size();\r\n  }\r\n};<\/pre>\n
     <\/p>\n","protected":false},"excerpt":{"rendered":"
    Problem \u9898\u76ee\u5927\u610f\uff1a\u7ed9\u4f60\u4e00\u4e9b\u5355\u8bcd\uff0c\u95ee\u8fd9\u4e9b\u5355\u8bcd\u7684\u83ab\u65af\u5bc6\u7801\u5171\u6709\u51e0\u79cd\u5f62\u5f0f\u3002 International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:\u00a0“a”\u00a0maps to\u00a0“.-“,\u00a0“b”\u00a0maps to\u00a0“-…”,\u00a0“c”\u00a0maps…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70,47],"tags":[222,82,4],"class_list":["post-2377","post","type-post","status-publish","format-standard","hentry","category-hashtable","category-string","tag-easy","tag-hashtable","tag-string","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/2377","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=2377"}],"version-history":[{"count":4,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/2377\/revisions"}],"predecessor-version":[{"id":2385,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/2377\/revisions\/2385"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=2377"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=2377"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=2377"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}