one line of code at a time
[leetcode] 1207. Unique Number of Occurrences 파이썬 코드 본문
https://leetcode.com/problems/unique-number-of-occurrences
hashmap을 이용해서 풀었다.
class Solution(object):
def uniqueOccurrences(self, arr):
occurrence = [False * i for i in range(len(arr)+1)]
occurDict = dict()
for i in range(len(arr)):
if arr[i] in occurDict:
occurDict[arr[i]] += 1
else:
occurDict[arr[i]] = 1
for key, value in occurDict.items():
if occurrence[value] == True:
return False
occurrence[value] = True
return True

'leetcode' 카테고리의 다른 글
| [leetcode] 1657. Determine if Two Strings Are Close 파이썬 코드 (0) | 2024.08.14 |
|---|---|
| [leetcode] 2352. Equal Row and Column Pairs 파이썬 코드 (0) | 2024.08.13 |
| [leetcode] 1004. Max Consecutive Ones III 파이썬 코드 (0) | 2024.08.13 |
| [leetcode] 1493. Longest Subarray of 1's After Deleting One Element 파이썬 코드 (0) | 2024.08.13 |
| [leetcode] 1456. Maximum Number of Vowels in a Substring of Given Length 파이썬 코드 (0) | 2024.08.13 |