[leetcode] 914. X of a Kind in a Deck of Cards @ python

原题

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

解法

先统计数字出现的个数, 然后求这些频率的最大公约数是否>= 2.

代码

class Solution(object):
    def hasGroupsSizeX(self, deck):
        """
        :type deck: List[int]
        :rtype: bool
        """
        def check(i):
            for n in d:
                if d[n] % i != 0:
                    return False
            return True
        
        if len(deck) < 2:
            return False
        d = collections.Counter(deck)
        m = min(d.values())
        for i in range(2, m+1):
            # check if the great common divisor is i
            if check(i):
                return True
        return False