leetcode——804

最新推荐文章于 2023-12-25 17:55:07 发布

musenh

最新推荐文章于 2023-12-25 17:55:07 发布

阅读量65

点赞数

分类专栏： java 文章标签： leecode

本文链接：https://blog.csdn.net/musenh/article/details/101050021

版权

java 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

将单词转化为摩斯电码
在这里插入图片描述

class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        HashMap<Character,String> m = new HashMap();//map将单词映射给莫斯码
        int i,j;
        String[]  p = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        Set<String> se = new HashSet();//用set自动去重
        for(i = 0;i < p.length;i++){
            m.put((char)(i + 97),p[i]);
        }
        for(i = 0 ; i < words.length; i++){
            char[] ch = words[i].toCharArray();
            String t = "";
            for(j = 0 ; j < ch.length;j++){
                t = t.concat(m.get(ch[j]));
            }
            se.add(t);
        }
        return se.size();
    }
}