【LeeCode做题日记（C/C++）--简单】804题：唯一摩尔斯密码词

最新推荐文章于 2020-05-07 22:27:42 发布

Joyce_Ff

最新推荐文章于 2020-05-07 22:27:42 发布

阅读量293

点赞数

分类专栏： LeeCode做题日记文章标签：摩尔斯密码数组不同元素计数

本文链接：https://blog.csdn.net/Joyce_Ff/article/details/88903998

版权

LeeCode做题日记专栏收录该内容

7 篇文章 0 订阅

订阅专栏

【题目】

【题目关注点】

数组中不同元素的数量计算。

【解答】

class Solution {
public:
    int uniqueMorseRepresentations(vector<string>& words) {
        string secret[] =
{".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..", "--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        int length = words.size();
        
        if(length==0){
            return NULL;
        }
        else{
            string result[length];
            string s,str;
            for(int i=0;i<length;++i){
                str = words[i];
                s = "";
                for(int j=0;j<str.size();++j){
                    int m = int(str[j])-97;
                    s = s+secret[m];
                }
                result[i] = s;
            }
            int flag;
            int count = 1;
            for(int n=0;n<length-1;++n){
                flag = 0;
                for(int k=n+1;k<length;++k){
                    if(result[n]==result[k])
                        flag = 1;
                 }
                if(flag==0){
                        ++count;
                }
            }
            return count;
        }
    
    }
};