|
1
2
3
4
5
6
7
|
class Solution:
def uniqueOccurrences(self, arr: List[int]) -> bool:
setArr=list(set(arr))
ans=[]
for i in setArr: ans.append(arr.count(i))
if sorted(ans)== sorted(list(set(ans))): return True
else : return False
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| leetcode 1356. Sort Integers by The Number of 1 Bits (0) | 2022.03.22 |
|---|---|
| leetcode 977. Squares of a Sorted Array (0) | 2022.03.22 |
| leetcode 2124. Check if All A's Appears Before All B's (0) | 2022.03.21 |
| leetcode 1460. Make Two Arrays Equal by Reversing Sub-arrays (0) | 2022.03.21 |
| leetcode 2032. Two Out of Three (0) | 2022.03.21 |
댓글