Java_唯一摩尔斯密码词(uniqueMorseRepresentations)

系统管理员 2023-06-02 09:12 37阅读 0赞

**题目**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0NoaWxsX0x5bg_size_16_color_FFFFFF_t_70]  
**思路**

> //创建morse数组，morseWords数组  
> //遍历words数组,遍历字符，与Morse匹配，StringBuilder拼接，存入morseWords数组  
> //遍历morseWords数组，与该元素之前元素对比，如果不重复，统计出现次数+1

class Solution {
        
        public int uniqueMorseRepresentations(String[] words) {
        
            String[] morse = {
         ".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--",
    				"-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.." };
    		String[] morseWords=new String[words.length];
    		for(int i=0;i<words.length;i++) {
        
    			StringBuilder sb=new StringBuilder();
    			for(int j=0;j<words[i].length();j++) {
        
    				sb.append(morse[words[i].charAt(j)-'a']);
    			}
    			morseWords[i]=sb.toString();
    		}
    		int count=0;
    		for(int i=0;i<morseWords.length;i++) {
        
    			boolean flag=false;
    			for(int j=0;j<i;j++) {
        
    				if(morseWords[j].equals(morseWords[i])) {
        
    					flag=true;
    					break;
    				}
    			}
    			if(flag) {
        
    				continue;
    			}
    			count++;
    		}
    		return count;
        }
    }

**测试结果**  
![在这里插入图片描述][20191004105108830.png]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L0NoaWxsX0x5bg_size_16_color_FFFFFF_t_70]: /images/20230601/9cb1f40f7bd04a99bfd68e5086031aed.png
[20191004105108830.png]: /images/20230601/1e6a316f8a274691b7ec1ccc8abd6a29.png