International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b" maps to "-...", "c" maps to "-.-.", and so on.
For convenience, the full table for the 26 letters of the English alphabet is given below:
~~~
[".-","-...","-.-.","-..",".","..-.","--.","....","..",
".---","-.-",".-..","--","-.","---",".--.","--.-",".-.",
"...","-","..-","...-",".--","-..-","-.--","--.."]
~~~
Now, given a list of words, each word can be written as a concatenation of the Morse code of each letter. For example, "cab" can be written as "-.-.-....-", (which is the concatenation "-.-." + "-..." + ".-"). We'll call such a concatenation, the transformation of a word.
Return the number of different transformations among all words we have.
~~~
Example:
Input: words = ["gin", "zen", "gig", "msg"]
Output: 2
Explanation:
The transformation of each word is:
"gin" -> "--...-."
"zen" -> "--...-."
"gig" -> "--...--."
"msg" -> "--...--."
There are 2 different transformations, "--...-." and "--...--.".
~~~
~~~
var morse = [".-","-...","-.-.","-..",".","..-.","--.","....",
"..",".---","-.-",".-..","--","-.","---",
".--.","--.-",".-.","...","-","..-","...-",
".--","-..-","-.--","--.."];
function to_morse(word){
var ret = [];
for(i in word){
var c = word[i].charCodeAt() - 'a'.charCodeAt();
s = morse[c];
ret.push(s);
}
return ret.join('');
}
var uniqueMorseRepresentations = function(words){
d = {};
var num =0;
for(j in words){
var s = to_morse(words[j]);
if(!(s in d)){
num++;
}
d[s] = 1;
}
return num;
}
~~~
> 思路:將將每個word轉換成morse碼,轉換方法是先計算出每個word中的每個字母與字母a的距離,然后就可以從數組 alphabet中取到每個字母的morse碼,然后將一個word中的每一個Morse碼拼接起來;在遍歷所有的words時候,將每個word對應的morse碼定義為某個對象的屬性,循環一次就判斷一下該屬性是否在這個對象中,不在的話,num++; 注意,不要忘記給對象的屬性賦值,否則會出錯
- 說明
- 排序
- java實現
- 二分歸并排序
- 快速排序
- js實現
- 冒泡排序 (Bubble Sort)
- 快速排序-js
- ES6-rest參數
- 比較排序
- 堆排序
- 插入排序
- 歸并排序
- 選擇排序
- shellSort
- 排序基礎知識
- 其他
- Rabbit
- chickenProblem
- 漢諾塔
- 取出兩個字符串中開頭相同的部分
- 兩個七進制輸入,輸出七進制
- 二維數組(矩陣)對角線輸出
- 根據概率取值
- 最小編輯距離算法
- 列劃分算法
- 數組去重
- 數組去重1
- 在一天里,鐘表的時針和分針會重合多少次?
- 找第二大問題
- Raft算法
- B-tree
- Leetcode JAVA實現
- leetcode1. 2 Sum
- leetcode2. Add Two Numbers
- leetcode7. Reverse Integer
- leetcode8. String to Integer (atoi)
- leetcode12. Integer to Roman
- leetcode13. Roman to Integer
- leetcode15. 3Sum
- leetcode18. 4Sum
- leetcode20. Valid Parentheses
- leetcode26. Remove Duplicates from Sorted Array
- leetcode27. Remove Element
- leetcode58. Length of Last Word
- leetcode66. Plus One
- leetcode67. Add Binary
- leetcode80. Remove Duplicates from Sorted Array II
- leetcode 88. Merge Sorted Array
- leetcode101. Symmetric Tree
- leetcode104. Maximum Depth of Binary Tree
- leetcode110. Balanced Binary Tree
- leetcode118. Pascal's Triangle
- leetcode119. Pascal's Triangle II
- leetcode121. Best Time to Buy and Sell Stock
- leetcode125. Valid Palindrome
- leetcode136. Single Number
- leetcode144. Binary Tree Preorder Traversal
- leetcode145. Binary Tree Postorder Traversal
- leetcode155. Min Stack
- leetcode169. Majority Element
- leetcode171. Excel Sheet Column Number
- leetcode172. Factorial Trailing Zeroes
- leetcode189. Rotate Array
- leetcode191. Number of 1 Bits
- leetcode202. Happy Number
- leetcode203. Remove Linked List Elements
- leetcode204. Count Primes
- leetcode225. Implement Stack using Queues
- leetcode226. Invert Binary Tree
- leetcode231. Power of Two
- leetcode232. Implement Queue using Stacks
- leetcode234. Palindrome Linked List
- leetcode237. Delete Node in a Linked List
- leetcode242. Valid Anagram
- leetcode258. Add Digits
- leetcode263. Ugly Number
- leetcode283. Move Zeroes
- leetcode292. Nim Game
- leetcode344. Reverse String
- leetcode371. Sum of Two Integers
- leetcode804. Unique Morse Code Words
- Leetcode JS 實現
- Js-leetcode 1. Two Sum
- Js-leetcode 2. Add Two Numbers
- Js-leetcode 10. Regular Expression Matching
- Js-leetcode 14. Longest Common Prefix
- Js-leetcode 17.Letter Combinations of a Phone Number
- Js-leetcode 20. Valid Parentheses
- Js-leetcode 27. Remove Element
- Js-leetcode 30. Substring with Concatenation of All Words
- Js-leetcode 35. Search Insert Position
- Js-leetcode 41. First Missing Positive
- Js-leetcode 48. Rotate Image
- Js-leetcode 53. Maximum Subarray
- Js-leetcode 54. Spiral Matrix
- Js-leetcode 73. Set Matrix Zeroes
- Js-leetcode 75. Sort Colors
- Js-leetcode 85. Maximal Rectangle
- Js-leetcode 89. Gray Code
- Js-leetcode 93.Restore IP Addresses
- Js-leetcode 98. Validate Binary Search Tree
- Js-leetcode 104. Maximum Depth of Binary Tree
- Js-leetcode 118. Pascal's Triangle
- Js-leetcode 121. Best Time to Buy and Sell Stock
- Js-leetcode 136. Single Number
- Js-leetcode 164. Maximum Gap
- Js-leetcode 189. Rotate Array
- Js-leetcode 215. Kth Largest Element in an Array
- Js-leetcode 217. Contains Duplicate
- Js-leetcode 258. Add Digits
- Js-leetcode 263.Ugly Number
- Js-leetcode 283. Move Zeroes
- Js-leetcode 326. Power of Three
- Js-leetcode 434. Number of Segments in a String
- Js-leetcode 459. Repeated Substring Pattern
- Js-leetcode 507. Perfect Number
- Js-leetcode 537. Complex Number Multiplication
- Js-leetcode 541. Reverse String II
- Js-leetcode 551. Student Attendance Record I
- Js-leetcode 557. Reverse Words in a String III
- Js-leetcode 605. Can Place Flowers
- Js-leetcode 606. Construct String from Binary Tree
- Js-leetcode 621. Task Scheduler
- Js-leetcode 622. Design Circular Queue
- Js-leetcode 633. Sum of Square Numbers
- Js-leetcode 657. Robot Return to Origin
- Js-leetcode 682. Baseball Game
- Js-leetcode 686. Repeated String Match
- Js-leetcode 696. Count Binary Substrings
- Js-leetcode 709.To Lower Case.md
- Js-leetcode 771 Jewels and Stones
- Js-leetcode 804.Unique Morse Code Words
- Js-leetcode 867. Transpose Matrix
- Js-leetcode 905. Sort Array By Parity
- Js-leetcode 914. X of a Kind in a Deck of Cards
- Js-leetcode 922. Sort Array By Parity II
- Js-leetcode 1221. Split a String in Balanced Strings
- Js-leetcode 3. Longest substring without repeating characters
- document
- 劉宇波老師--基礎知識
- 算法與數據結構
- 數據機構與算法介紹
- 二叉樹
- 堆
- 鏈表
- 隊列
- 并查集
- 最小生成樹
- 圖論
- 最短路徑
- 總結
- 玩轉數據結構
- 介紹
- 數組
- 棧和隊列
- 玩轉鏈表
- 鏈表與遞歸
- 二分搜索樹
- 集合與映射
- 第8章 優先隊列和堆
- 第9章 線段樹
- 第10章 Trie
- 玩轉算法面試 leetcode題庫分門別類詳細解析
- 第一章 介紹
- 第二章 時間復雜度和空間復雜度
- 第三章
- 深度實戰玩轉算法
- JS數據結構與算法
- 第一章.介紹
- 第二章.字符串
- 第三章.數組
- 第四章
- 第五章.排序
- 第六章.遞歸
- 第七章.棧
- 第八章.隊列
- 第九章.鏈表
- 第十章.矩陣
- 第十一章.二叉樹
- 第十二章.堆
- 極客時間
- 第01課丨數據結構與算法總覽
- 第02課丨訓練準備和復雜度分析
- 第03課丨數組、鏈表、跳表
- 第04課丨棧、隊列、優先隊列、雙端隊列
- 算法基礎
- 哈希表(散列表)
- 異或運算
- leetcode
- KD樹(K-Dimension Tree)
- Rtree
- B站-左神
- 一周刷爆LeetCode,算法大神左神(左程云)耗時100天打造算法與數據結構基礎到高級全家桶教程,直擊BTAJ等一線大廠必問算法面試題真題詳解
- 簡單的排序算法
- 認識Nlog(N)的算法
- 第三節:桶排序及排序算法總結
- 左程云算法課程
- 1 認識復雜度、對數器、二分法與異或運算
- 2 鏈表結構、棧、隊列、遞歸行為、哈希表和有序表
- 10道BAT必問算法面試題
- 超級水王問題
- 78節
- 04鏈表