leetcode-5.11[804. 唯一摩尔斯密码词、1207. 独一无二的出现次数]（python实现)

题目1

题解1

class Solution:
    def uniqueMorseRepresentations(self, words: List[str]) -> int:
        Morse = [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]
        unique_word = set()
        for i in range(len(words)):
            temp = ''
            for w in words[i]:
                temp += Morse[ord(w)-97]
            unique_word.add(temp)
        return len(unique_word)  

附上题目链接

题目2

题解2:

class Solution:
    def uniqueOccurrences(self, arr: List[int]) -> bool:
        from collections import Counter
        counts = Counter(arr)
        return len(set(counts.values())) == len(counts.values())

附上题目链接