leetcode

1.第796题—旋转字符串

有一字符串A： abcde 旋转一次变为 bcdea，如果旋转若干次A能变成B 返回true否则返回false

js

var rotateString = function (A,B){
    return (A.length === B.length) && (A + A).includes(B)
}

2.第804题—唯一摩尔斯密码词

国际莫尔斯密码定义一种标准编码方式：为了方便定义了所有26个字母的编码方式
[“.-“,”-…”,”-.-.”,”-..”,”.”,”..-.”,”–.”,”….”,”..”,”.—“,”-.-“,”.-..”,”–”,”-.”,”—“,”.–.”,”–.-“,”.-.”,”…”,”-“,”..-“,”…-“,”.–”,”-..-“,”-.–”,”–..”]

例如:
输入: words = [“gin”, “zen”, “gig”, “msg”]
输出: 2
解释:
各单词翻译如下:
*”gin” -> “–…-.”*
]“zen” -> “–…-.”*
*”gig” -> “–…–.”*
*”msg” -> “–…–.”*

共有 2 种不同翻译, “–…-.” 和 “–…–.”.

js

var uniqueMorseRepresentations = function(words) {
    let sets = new Set()
    const list = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
    words.forEach(el=>{
        let a = '';
        el.split('').forEach(el=>{
            a = a + list[el.charCodeAt() - 'a'.charCodeAt()]
        })
        sets.add(a)
    })
    return sets.size
};
console.log(uniqueMorseRepresentations(["gin", "zen", "gig", "msg"]))