add 804

Author: clingoram

javascript/LeetCode/Array/804.js

@@ -0,0 +1,34 @@
+/**
+ * 804. Unique Morse Code Words
+ * 
+ * 給一個字串陣列作為參數，把該陣列內的元素一一拆開成字元，去比對每個字元轉換成摩斯密碼後共有幾個不同的
+ * 
+ * 英文字母是小寫
+ * @param {string[]} words
+ * @return {number}
+ */
+var uniqueMorseRepresentations = function(words) {
+  // 26英文字母分別代表的morse code
+  let morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."];
+
+  let set = new Set();
+  for(const letter of words){
+    let combine = "";
+    for(const a of letter) {
+      combine += morse[a.charCodeAt(0) - 'a'.charCodeAt(0)];
+    }
+    set.add(combine);
+  }
+  return set.size;
+};
+let words = ["gin","zen","gig","msg"]
+/*
+Output: 2
+Explanation: The transformation of each word is:
+"gin" -> "--...-."
+"zen" -> "--...-."
+"gig" -> "--...--."
+"msg" -> "--...--."
+There are 2 different transformations: "--...-." and "--...--.".
+*/
+console.log(uniqueMorseRepresentations(words));

javascript/index.js

@@ -836,7 +836,7 @@ var longestPalindrome = function(words) {
 
 
 };
-let words = ["ab","ty","yt","lc","cl","ab"];
+// let words = ["ab","ty","yt","lc","cl","ab"];
 // 8
 // "ty" + "lc" + "cl" + "yt" = "tylc clyt"
 // abtyytba
@@ -1383,4 +1383,5 @@ Query 0: The element at queries[0] = 0 is nums[0] = 1. The nearest index with th
 Query 1: The element at queries[1] = 3 is nums[3] = 4. No other index contains 4, so the result is -1.
 Query 2: The element at queries[2] = 5 is nums[5] = 3. The nearest index with the same value is 1, and the distance between them is 3 (following the circular path: 5 -> 6 -> 0 -> 1).
 */
-// console.log(solveQueries(nums,queries));
+// console.log(solveQueries(nums,queries));
+