LeetCode --- 1207. Unique Number of Occurrences 解题报告
Posted 杨鑫newlfe
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 1207. Unique Number of Occurrences 解题报告相关的知识，希望对你有一定的参考价值。
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
所有代码均可在Github中找到：
以上是关于LeetCode --- 1207. Unique Number of Occurrences 解题报告的主要内容，如果未能解决你的问题，请参考以下文章
Leetcode 1207. Unique Number of Occurrences
1207. Unique Number of Occurrences