leetcode 804. Unique Morse Code Words

最新推荐文章于 2022-02-18 14:39:22 发布
原创 最新推荐文章于 2022-02-18 14:39:22 发布 · 91 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文介绍了一种使用C++实现的独特摩尔斯电码转换器。该程序通过将输入的单词转换为对应的摩尔斯电码表示，并计算不同单词转换后的唯一摩尔斯电码数量。通过这种方式，可以有效地识别和区分不同的单词。 
#include<set>
class Solution {
public:
    string code[26]={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
    int uniqueMorseRepresentations(vector<string>& words) {
        int l = words.size();
        set<string> de;
        for(int i =0;i<l;i++)
        {
            string tmp;
           for(int j=0;j<words[i].length();j++)
           {
               tmp += code[words[i][j]-'a'];
           }
            if(de.find(tmp)!=de.end())continue;
            else de.insert(tmp);
        }
        return de.size();
    }
};

 

LeetCode --- 804. Unique Morse Code Words 解题报告
杨鑫newlife的专栏
07-17 418
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 Eng...
Leetcode 804. Unique Morse Code Words
SnailTyan
05-17 235
文章作者：Tyan 博客：noahsnail.com  |  优快云  |  简书 1. Description 2. Solution Version 1 class Solution: def uniqueMorseRepresentations(self, words: List[str]) -> int: az = [chr(x) for x in range(ord('a'), ord('z') + 1)]
python leetcode 804. Unique Morse Code Words
DreamerLHQ的博客
05-02 581
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
leetcode804. Unique Morse Code Words
北纬的博客
07-21 179
class Solution { public: int uniqueMorseRepresentations(vector<string>& words) { vector<string> a={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-....
LeetCode 804. Unique Morse Code Words
weixin_33857679的博客
12-21 153
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...
Leetcode 804. Unique Morse Code Words [Python]
sinat_30403031的博客
02-18 348
words中的word转化为摩尔斯码，丢到set里，计算set长度。 class Solution: def uniqueMorseRepresentations(self, words: List[str]) -> int: map = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-",
leetcode 804. Unique Morse Code Words (Python)
只此一身青春
11-14 270
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" map...
LeetCode804. Unique Morse Code Words
anyizhe7949的博客
02-18 186
题目 国际摩尔斯密码定义一种标准编码方式，将每个字母对应于一个由一系列点和短线组成的字符串，比如:"a"对应".-","b"对应"-...","c"对应"-.-.", 等等。 为了方便，所有26个英文字母对应摩尔斯密码表如下： [".-","-...","-.-.","-..",".","..-.","--.","....",...
804. Unique Morse Code Words
Shezzer的博客
03-31 607
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
Leetcode 804.Unique Morse Code Words （Java）
lovrain的博客
03-28 739
问题描述：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
leetcode伪代码-unique-morse-code-words:独特的莫尔斯电码词
06-30
leetcode伪代码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 ...
morses = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."] def get_morses(words_str): morses_words_str = "" for letter in words_str: morses_words_str += morses[ord(letter) - 97] print(morses_words_str) return morses_words_str def sovle(words_str): s = set() for word in words_str: morses_word = get_morses(words_str) s.add(morses_word) print(s) return len(s) words = "GIN zen gig msg" words_str = words.lower() print(sovle(words))
最新发布
07-24
Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/)。该问题要求将一组单词转换为摩尔斯电码，并统计其中有多少个**不同的摩尔斯电码表示**。 不过，你当前的代码中存在一些错误...
leetcode 557. Reverse Words in a String III
清风吹斜阳
04-13 2340
#include<stack> class Solution { public: string reverseWords(string s) { int l = s.length(); int i = 0; string res; stack<char> tmp; w...
Leetcode 1018. Binary Prefix Divisible By 5
清风吹斜阳
07-08 358
#include<math.h> class Solution { public: vector<bool> prefixesDivBy5(vector<int>& A) { int l = A.size(); vector<bool> res(l); int rem...
leetcode 232. Implement Queue using Stacks
清风吹斜阳
03-30 323
思路：两个栈,s1,s2，每次push的时候将其放入到s1，当pop或top的时候，将s1中的元素依次取出放入s2中，这样s2pop的顺序就是队列的顺序了。 #include<stack> class MyQueue { public: stack<int> s1,s2; int length =0; /** Initialize your d...
leetcode 1013. Partition Array Into Three Parts With Equal Sum
清风吹斜阳
04-12 281
class Solution { public: bool canThreePartsEqualSum(vector<int>& A) { int l = A.size(); int sum=0; int i; for(i=0;i<l;i++) sum+=A[i]; ...
leetcode 700. Search in a Binary Search Tree
清风吹斜阳
04-12 247
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla...
提升编程效率：leetcode.vim插件详解
标题“leetcode.vim：解决Vim中的LeetCode问题！”揭示了这个Vim插件的核心功能。开发者们创造了这个插件，以利用Vim的编辑效率和LeetCode的练习平台，让程序员可以在自己熟悉的文本编辑器中直接解决算法和数据结构...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值