【leetcode】【easy】【每日一题】914. X of a Kind in a Deck of Cards​​​​​​​

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: deck = [1,2,3,4,4,3,2,1]
Output: true
Explanation: Possible partition [1,1],[2,2],[3,3],[4,4].

Example 2:

Input: deck = [1,1,1,2,2,2,3,3]
Output: false´
Explanation: No possible partition.

Example 3:

Input: deck = [1]
Output: false
Explanation: No possible partition.

Example 4:

Input: deck = [1,1]
Output: true
Explanation: Possible partition [1,1].

Example 5:

Input: deck = [1,1,2,2,2,2]
Output: true
Explanation: Possible partition [1,1],[2,2],[2,2].

Constraints:

• 1 <= deck.length <= 10^4
• 0 <= deck[i] < 10^4

题目链接：https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards/

 

思路

题乍看简单，一开始以为只需要数各个值的个数，判断所有个数是否相等即可，其实还有小坑：同一值可能分为2个group。

因此每个值的个数要求应是最大公因数>=2。

class Solution {
public:
    bool hasGroupsSizeX(vector<int>& deck) {
        int num = deck.size();
        if(num<2) return false;
        unordered_map<int,int> rec;
        for(int i=0; i<num; ++i){
            ++rec[deck[i]];
        }
        int x = rec.begin()->second;
        if(x<2) return false;
        for(auto iter=rec.begin(); iter!=rec.end(); ++iter){
            if(x!=iter->second) {
                int tmp = gcd(x, iter->second);
                if(tmp<2) return false;
                x = tmp;
            }
        }
        return true;
    }
    int gcd(int a, int b){
        int s = min(a,b);
        int l = max(a,b);
        if(l%s==0) return s;
        return gcd(s, l%s);
    }
};