solve problem Unique Morse Code Words

Author: P-ppc

README.md

@@ -8,4 +8,5 @@ All solutions will be accepted!
 |657|[Judge Route Circle](https://leetcode-cn.com/problems/judge-route-circle/description/)|[java/py/js](./algorithms/JudgeRouteCircle)|Easy|
 |461|[Hamming Distance](https://leetcode-cn.com/problems/hamming-distance/description/)|[java/py/js](./algorithms/HammingDistance)|Easy|
 |476|[Number Complement](https://leetcode-cn.com/problems/number-complement/description/)|[java/py/js](./algorithms/NumberComplement)|Easy|
-|728|[Self Dividing Numbers](https://leetcode-cn.com/problems/self-dividing-numbers/description/)|[java/py/js](./algorithms/SelfDividingNumbers)|Easy|
+|728|[Self Dividing Numbers](https://leetcode-cn.com/problems/self-dividing-numbers/description/)|[java/py/js](./algorithms/SelfDividingNumbers)|Easy|
+|804|[Unique Morse Code Words](https://leetcode-cn.com/problems/unique-morse-code-words/description/)|[java/py/js](./algorithms/UniqueMorseCodeWords)|Easy|

algorithms/SelfDividingNumbers/README.md

@@ -1,2 +1,2 @@
 # Self Dividing Numbers
-This program is easy to solve
+This problem is easy to solve

algorithms/UniqueMorseCodeWords/README.md

@@ -0,0 +1,2 @@
+# Unique Morse Code Words
+This problem is easy to solve

algorithms/UniqueMorseCodeWords/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int uniqueMorseRepresentations(String[] words) {
+        String[] checkList = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
+        Set<String> translatedSet = new HashSet<String>();
+        for (String word : words) {
+            String translatedStr = "";
+            for (char c : word.toCharArray()) {
+                translatedStr += checkList[(int) c - 97];
+            }
+            translatedSet.add(translatedStr);
+        }
+        return translatedSet.size();
+    }
+}

algorithms/UniqueMorseCodeWords/solution.js

@@ -0,0 +1,16 @@
+/**
+ * @param {string[]} words
+ * @return {number}
+ */
+var uniqueMorseRepresentations = function(words) {
+    let checkList = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
+    let translatedSet = new Set()
+    words.forEach(word => {
+        let translatedStr = ''
+        word.split('').forEach(char => {
+            translatedStr += checkList[char.charCodeAt() - 'a'.charCodeAt()]
+        })
+        translatedSet.add(translatedStr)
+    })
+    return translatedSet.size
+};

algorithms/UniqueMorseCodeWords/solution.py

@@ -0,0 +1,14 @@
+class Solution(object):
+    def uniqueMorseRepresentations(self, words):
+        """
+        :type words: List[str]
+        :rtype: int
+        """
+        check_list = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
+        translated_set = set()
+        for word in words:
+            translated_str = ''
+            for char in word:
+                translated_str += check_list[ord(char) - ord('a')]
+            translated_set.add(translated_str)
+        return len(translated_set)