【LeetCode】 914. X of a Kind in a Deck of Cards 卡牌分组（Easy）（JAVA）

本文链接：https://blog.csdn.net/qq_16927853/article/details/105133969

【LeetCode】 914. X of a Kind in a Deck of Cards 卡牌分组（Easy）（JAVA）

题目地址: https://leetcode.com/problems/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:

1. Each group has exactly X cards.
2. 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. 1 <= deck.length <= 10^4
2. 0 <= deck[i] < 10^4

题目大意

给定一副牌，每张牌上都写着一个整数。

此时，你需要选定一个数字 X，使我们可以将整副牌按下述规则分成 1 组或更多组：

1. 每组都有 X 张牌。
2. 组内所有的牌上都写着相同的整数。

仅当你可选的 X >= 2 时返回 true。

解题方法

1、记录下每个元素的个数
2、求出最大公因数是否大于 2

class Solution {
    public boolean hasGroupsSizeX(int[] deck) {
        if (deck.length <= 1) return false;
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < deck.length; i++) {
            Integer temp = map.get(deck[i]);
            if (temp == null) {
                map.put(deck[i], 1);
            } else {
                map.put(deck[i], temp + 1);
            }
        }
        int min = -1;
        for (Map.Entry<Integer, Integer> entry: map.entrySet()) {
            if (min < 0) {
                min = entry.getValue();
            } else {
                min = gcd(min, entry.getValue());
            }
            if (min < 2) return false;
        }
        return true;
    }

    public int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }
}

执行用时 : 12 ms, 在所有 Java 提交中击败了 47.35% 的用户
内存消耗 : 42.1 MB, 在所有 Java 提交中击败了 5.64% 的用户