X of a Kind in a Deck of Cards LT914

2019-04-24 08:54:19 阅读：235 来源： 互联网

标签：Kind return deck int intCnt LT914 num Cards preVal

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

Idea 1. count the occurences of each number in the deck and check if the greatest common divisor of all counts pair > 1

Time complexity: O(Nlog^2N), where N is the number of cards. gcd operation is O(log^2C) if there are C cards for number i. need to read further about it.

Space complexity: O(N)

 1 class Solution {
 2     int gcd(int a, int b) {
 3         while(b != 0) {
 4             int temp = b;
 5             b = a%b;
 6             a = temp;
 7         }
 8         return a;
 9     }
10     public boolean hasGroupsSizeX(int[] deck) {
11         if(deck.length < 2) {
12             return false;
13         }
14         
15         Map<Integer, Integer> intCnt = new HashMap<>();
16         for(int num: deck) {
17             intCnt.put(num, intCnt.getOrDefault(num, 0) + 1);
18         }
19         
20         
21         int preVal = -1;
22         for(int val: intCnt.values()) {
23             if(val == 1) {
24                 return false;
25             }
26             if(preVal == -1) {
27                 preVal = val;
28             }
29             else {
30                 preVal = gcd(preVal, val);
31                 if(preVal == 1) {
32                     return false;
33                 }   
34             }
35         }
36         
37         return preVal >= 2;
38     }
39 }

网上看到的超级简洁，自己的差好远，还有很长的路啊

class Solution {
    int gcd(int a, int b) {
        while(b != 0) {
            int temp = b;
            b = a%b;
            a = temp;
        }
        return a;
    }
    public boolean hasGroupsSizeX(int[] deck) {
        Map<Integer, Integer> intCnt = new HashMap<>();
        for(int num: deck) {
            intCnt.put(num, intCnt.getOrDefault(num, 0) + 1);
        }
        
        
        int res = 0;
        for(int val: intCnt.values()) {
            res = gcd(val, res);  
        }
        
        return res >= 2;
    }
}

标签：Kind,return,deck,int,intCnt,LT914,num,Cards,preVal
来源： https://www.cnblogs.com/taste-it-own-it-love-it/p/10760357.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

X of a Kind in a Deck of Cards LT914