Leetcode-Problems/UniqueMorseCodeWords.java at main · mchirag2002/Leetcode-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
import java.util.Arrays;

public class UniqueMorseCodeWords {
//    https://leetcode.com/problems/unique-morse-code-words/
    public static void main(String[] args) {
        String[] words = {"zocd","gjkl","hzqk","hzgq","gjkl"};
        System.out.println(uniqueMorseRepresentations(words));
    }
    public static int uniqueMorseRepresentations(String[] words) {
        String[] morseCode = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        int count = 0;
//        if(words.length>0)
//        {
//            count=1;
//        }
        String[] morse = new String[words.length];
        int[] number = new int[words.length];
        for (int i = 0; i < morse.length; i++) {
            morse[i] = "";
        }
        for (int i = 0; i < number.length; i++) {
            number[i] = 0;
        }
        for (int i = 0; i < words.length; i++) {
            for (int j = 0; j < words[i].length(); j++) {
                char ch = words[i].charAt(j);
                morse[i] = morse[i] + morseCode[ch-'a'];
            }
        }
        for (int i = 0; i < morse.length; i++) {
            for (int j = i+1; j < morse.length; j++) {
                if(number[i]==1)
                {
                    continue;
                }
                if(morse[i].equals(morse[j]))
                {
                    number[j]=1;
                }
            }
        }
        for (int i = 0; i < number.length; i++) {
            if(number[i]==0)
            {
                count++;
            }
        }
        return count;
    }
}