엔지니어 게시판
LeetCode 솔루션 분류

[11/30] 1207. Unique Number of Occurrences

컨텐츠 정보

본문

Easy
292062Add to ListShare

Given an array of integers arr, return true if the number of occurrences of each value in the array is unique, or false otherwise.

 

Example 1:

Input: arr = [1,2,2,1,1,3]
Output: true
Explanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two values have the same number of occurrences.

Example 2:

Input: arr = [1,2]
Output: false

Example 3:

Input: arr = [-3,0,1,-3,1,1,1,-3,10,0]
Output: true

 

Constraints:

  • 1 <= arr.length <= 1000
  • -1000 <= arr[i] <= 1000
Accepted
228,153
Submissions
310,071

관련자료

댓글 1

학부유학생님의 댓글

  • 익명
  • 작성일
Runtime: 72 ms, faster than 43.04% of Python3 online submissions for Unique Number of Occurrences.
Memory Usage: 14 MB, less than 33.95% of Python3 online submissions for Unique Number of Occurrences.
import collections
class Solution:
    def uniqueOccurrences(self, arr: List[int]) -> bool:
        counter = collections.Counter(arr)
        
        seen = set()
        
        for key, val in counter.items():
            if val in seen:
                return False
            seen.add(val)
            
        
        return True
전체 349 / 1 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


  • 현재 접속자 59 명
  • 오늘 방문자 135 명
  • 어제 방문자 1,716 명
  • 최대 방문자 2,853 명
  • 전체 회원수 535 명
알림 0