2019獨(dú)角獸企業(yè)重金招聘Python工程師標(biāo)準(zhǔn)>>>

804. Unique Morse Code Words

題目鏈接

804. Unique Morse Code Words

題目分析

這個(gè)題目要求算出把給定數(shù)組中的字符串轉(zhuǎn)換成摩爾斯碼后，有多少個(gè)不同的摩爾斯碼。

思路

第一步需要把字符串轉(zhuǎn)換成摩爾斯碼。

$morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.." ]; $replaced = []; foreach($words as $word){$chars = str_split($word);$string = '';foreach($chars as $char){$string .= $morse[ord($char)-ord('a')];} }

轉(zhuǎn)換完成后存進(jìn)數(shù)組內(nèi)，再用array_unique函數(shù)排除。再count排除結(jié)果即可。

最終代碼

<?php class Solution {function uniqueMorseRepresentations($words) {$morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."];$replaced = [];foreach($words as $word){$chars = str_split($word);$string = '';foreach($chars as $char){$string .= $morse[ord($char)-ord('a')];}$replaced[] = $string;}return count(array_unique($replaced));} }

若覺(jué)得本文章對(duì)你有用，歡迎用愛(ài)發(fā)電資助。

優(yōu)化方案

• 直接存為數(shù)組的鍵則可以省去用array_unique去重的步驟。

轉(zhuǎn)載于:https://my.oschina.net/u/2246923/blog/3022285

總結(jié)

以上是生活随笔為你收集整理的Leetcode PHP题解--D5 804. Unique Morse Code Words的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。