Commit 7a9aa15

authored

feat: [LeetCode #1207] Unique Number Of Occurrences (#10)

Тип: hashmap/set Сложность: easy Временная сложность: O(n) Пространственная сложность: O(n) - Ссылка: https://leetcode.com/problems/unique-number-of-occurrences/

1 parent c522302 commit 7a9aa15Copy full SHA for 7a9aa15

File tree

+23

-0

lines changed

+23

-0

lines changed

Whitespace-only changes.

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,8 @@`
	`1`	`+from typing import List`
	`2`	`+from collections import Counter`
	`3`	`+`
	`4`	`+`
	`5`	`+class Solution:`
	`6`	`+ def uniqueOccurrences(self, arr: List[int]) -> bool:`
	`7`	`+ counts = Counter(arr).values()`
	`8`	`+ return len(counts) == len(set(counts))`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+import pytest`
	`2`	`+from src.hashmap_set.unique_number_of_occurrences.solution import Solution`
	`3`	`+`
	`4`	`+`
	`5`	`+@pytest.mark.parametrize(`
	`6`	`+ "arr, expected",`
	`7`	`+ [`
	`8`	`+ ([1, 2, 2, 1, 1, 3], True),`
	`9`	`+ ([1, 2], False),`
	`10`	`+ ([-3, 0, 1, -3, 1, 1, 1, -3, 10, 0], True),`
	`11`	`+ ],`
	`12`	`+)`
	`13`	`+def test_unique_occurrences(arr, expected):`
	`14`	`+ solution = Solution()`
	`15`	`+ assert solution.uniqueOccurrences(arr) == expected`

Comments

(0)