804. 唯一摩尔斯密码词

最新推荐文章于 2019-11-26 09:41:43 发布

原创最新推荐文章于 2019-11-26 09:41:43 发布 · 293 阅读

0 ·

CC 4.0 BY-SA版权

LeeCode 专栏收录该内容

14 篇文章

订阅专栏

本文介绍摩尔斯密码编码方式，展示如何将英文单词转换为摩尔斯密码，并通过实例演示如何计算一组单词转换后的不同摩尔斯密码组合数量。涉及算法实现和字符串操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

国际摩尔斯密码定义一种标准编码方式，将每个字母对应于一个由一系列点和短线组成的字符串，比如: "a" 对应 ".-", "b" 对应 "-...", "c" 对应 "-.-.", 等等。

为了方便，所有26个英文字母对应摩尔斯密码表如下：

[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]

给定一个单词列表，每个单词可以写成每个字母对应摩尔斯密码的组合。例如，"cab" 可以写成 "-.-..--..."，(即 "-.-." + "-..." + ".-"字符串的结合)。我们将这样一个连接过程称作单词翻译。

返回我们可以获得所有词不同单词翻译的数量。

public static int mosi(){
		String[] base = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
		String[] words = {"gin", "zen", "gig", "msg"};
		String[] charToStringS = new String[words.length];
		int x = 0 ;
		        if(words.length == 0){
            return 0;
        }else if (words.length == 1){
            return 1;
        }
		for (int i = 0 ; i < words.length ; i++){
			String str = words[i];
			charToStringS[i] = "";
			char[] chars = str.toCharArray();
			for(int j = 0 ; j < chars.length ; j++){
				char c = chars[j];
				int k = c - 'a';
				charToStringS[i] += base[k];
			}
			System.out.print(str+"->");
			System.out.println(charToStringS[i]);
		}
		
		Set<String> set = new HashSet<>() ;
		for(int i = 0 ; i < charToStringS.length; i++){
			 set.add(charToStringS[i]) ;
		}
		return set.size();
	}