-
Notifications
You must be signed in to change notification settings - Fork 0
/
hasGroupsSizeX.py
62 lines (47 loc) · 1.42 KB
/
hasGroupsSizeX.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
# https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/description/
# 914. X of a Kind in a Deck of Cards
# In a deck of cards, each card has an integer written on it.
# Return true if and only if you can choose X >= 2 such that it is possible to split the entire deck into
# 1 or more groups of cards, where:
# Each group has exactly X cards.
# All the cards in each group have the same integer.
# Example 1:
# Input: [1,2,3,4,4,3,2,1]
# Output: true
# Explanation: Possible partition [1,1],[2,2],[3,3],[4,4]
# Example 2:
# Input: [1,1,1,2,2,2,3,3]
# Output: false
# Explanation: No possible partition.
# Example 3:
# Input: [1]
# Output: false
# Explanation: No possible partition.
# Example 4:
# Input: [1,1]
# Output: true
# Explanation: Possible partition [1,1]
# Example 5:
# Input: [1,1,2,2,2,2]
# Output: true
# Explanation: Possible partition [1,1],[2,2],[2,2]
# Note:
# 1 <= deck.length <= 10000
# 0 <= deck[i] < 10000
from collections import Counter as c
from fractions import gcd
def hasGroupsSizeX(deck):
"""
:type deck: List[int]
:rtype: bool
"""
if reduce(gcd, c(deck).values()) == 1:
return False
return True
assert hasGroupsSizeX([1,2,3,4,4,3,2,1]) == True
assert hasGroupsSizeX([1,1,1,2,2,2,3,3]) == False
assert hasGroupsSizeX([1]) == False
assert hasGroupsSizeX([1,1]) == True
assert hasGroupsSizeX([1,1,2,2,2,2]) == True
assert hasGroupsSizeX([1,2,3,4]) == False
assert hasGroupsSizeX([0,0]) == True