zoukankan      html  css  js  c++  java
  • 【leetcode】唯一摩尔斯密码词

    int uniqueMorseRepresentations(char ** words, int wordsSize){
    
        char* morse[26] = { ".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.." };
    
        char* arr[100] = {0};
        int index = 0;
        bool flag = true;
        for (int i = 0; i < wordsSize; i++)
        {
            char* s = (char*)calloc(50, sizeof(char));
            for (int j = 0; j < strlen(words[i]); j++)
            {
                strcat(s, morse[words[i][j] - 97]);
            }
            for (int k = 0; k <= index; k++)
            {
                if (arr[k] && !strcmp(arr[k],s))
                {
                    flag = false;
                    break;
                }                
            }
            if (flag) arr[index++] = s;
            flag = true;
            
        }
        return index;
    }
  • 相关阅读:
    JZOJ.2117. 【2016-12-30普及组模拟】台风
    团队合作
    长沙游记
    统计
    html....
    OI之路
    三鑫普及组模拟赛
    牛顿迭代法
    台风
    gcd
  • 原文地址:https://www.cnblogs.com/ganxiang/p/13579809.html
Copyright © 2011-2022 走看看