leetcode 914. 卡牌分组

尝试了4次，总算是过了。

#  60 ms, 在所有 Python3 提交中击败了90.83%的用户
class Solution:
    def hasGroupsSizeX(self, deck: List[int]) -> bool:
        # [1,1,2,2,2,2]
        # [1,1,1,1,2,2,2,2,2,2]

        if len(deck)< 2:
            return False 
        s = set(deck) 
        ls = []
        for i in s:
            ls.append(deck.count(i))

        # print(ls)   
        g = 2
        while g <= min(ls):
            if all(i % g == 0 for i in ls):
                print("yes", g)
                return True 
            else:
                g += 1
        return False