804. Unique Morse Code Words

最新推荐文章于 2022-04-04 16:02:21 发布

onefanyf

最新推荐文章于 2022-04-04 16:02:21 发布

阅读量59

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_34471804/article/details/101004713

版权

leetcode 专栏收录该内容

77 篇文章 0 订阅

订阅专栏

#804. Unique Morse Code Words

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, “cba” can be written as “-.-…–…”, (which is the concatenation “-.-.” + “-…” + “.-”). We’ll call such a concatenation, the transformation of a word.

Return the number of different transformations among all words we have.

Example:
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 “–…--.”.

首先要把word里面的字符串转变成摩斯码。然后进行字符串比较。

var uniqueMorseRepresentations = function(words) {
    var mapTable = {
        a:".-",
        b:"-...",
        c:"-.-.",
        d:"-..",
        e:".",
        f:"..-.",
        g:"--.",
        h:"....",
        i:"..",
        j:".---",
        k:"-.-",
        l:".-..",
        m:"--",
        n:"-.",
        o:"---",
        p:".--.",
        q:"--.-",
        r:".-.",
        s:"...",
        t:"-",
        u:"..-",
        v:"...-",
        w:".--",
        x:"-..-",
        y:"-.--",
        z:"--.."
    }
    var newWords = new Array();
    for(var i=0;i<words.length;i++) {
        for(var j=0;j<words[i].length;j++) {
            if(j===0) {
                newWords[i]=mapTable[words[i][j]];
            }
            else {
                newWords[i]=newWords[i]+mapTable[words[i][j]];
            }
        }
    }
    var result =0;
    var resWords = new Array();
    for(var k=0;k<newWords.length;k++) {
        if(resWords.indexOf(newWords[k])==-1) {
            result++;
            resWords.push(newWords[k]);
        }
    }
    return result;
};