914. X of a Kind in a Deck of Cards

最新推荐文章于 2020-03-28 00:51:19 发布
最新推荐文章于 2020-03-28 00:51:19 发布
阅读量164 收藏
点赞数
分类专栏： leetcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/fadbgfnbxb/article/details/89394475
版权 
bool hasGroupsSizeX(vector<int>& deck) 
    {
        unordered_map<int, int> nums;
        int res = 0;
        for(auto &n : deck)
            nums[n]++;
       
        for(auto num : nums)
        {
            res = __gcd(num.second,res);
        }
        return res > 1;
    }

 

心向暖
关注
专栏目录
LeetCode --- 914. X of a Kind in a Deck of Cards 解题报告
杨鑫newlife的专栏
04-18 220
In a deck of cards, each card has an integer written on it. Returntrueif and only if you can chooseX >= 2such that it is possible to split the entire deck into 1 or more groups of cards, where: Each group has exactlyXcards. All the cards in eac...
Little_Women6.txt
m0_47456600的博客
08-21 1697
CHAPTER THIRTY-ONE OUR FOREIGN CORRESPONDENT London Dearest People, Here I really sit at a front window of the Bath Hotel, Piccadilly. It’s not a fashionable place, but Uncle stopped here years ago, and won’t go anywhere else. However, we don’t mean to s
[leetcode]914. X of a Kind in a Deck of Cards (easy)
Rh's blog
10-09 439
原题 题目原意可转换为 两组有大于等于2的公因数 /** * @param {number[]} deck * @return {boolean} */ var hasGroupsSizeX = function(deck) { var map = {}; for (let i = 0; i &lt; deck.length; i++) { if (map[deck[i]])...
leetcode 914. X of a Kind in a Deck of Cards
qq_35753140的博客
11-03 381
题目 一摞牌，每张牌上写了一个整数，如果能找到一个大于等于2的数X，把牌分成1或多组满足下列条件： 每组有X张牌 每组里的每张牌上写得数字都是一样的 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:...
914. X of a Kind in a Deck of Cards（python+cpp）
小湉湉的博客
11-05 324
题目： In a deck of cards, each card has an integer written on it. Return true if and only if you can choose X&gt;= 2 such that it is possible to split the entire deck into 1 or more groups of cards, w...
import random random.seed(10) class Deck: def init(self): ranks = ['A', '2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K'] suits = ['C', 'D', 'H', 'S'] self.deck = [s + r for s in suits for r in ranks] random.shuffle(self.deck) def hand(self, n=1): #拿一手牌，n张 hand = [self.deck[i] for i in range(n)] del self.deck[:n] return hand def deal(self, cards_per_hand, no_of_players): #发牌，cards_per_hand：每个人发牌数， no_of_players：人数 return [self.hand(cards_per_hand) for i in range(no_of_players)] def str(self): return str(self.deck) def same_rank(hand, n_of_a_kind): #分析牌有对或者3-4个 #hand:一手牌，n_of_a_kind：2~4 寻找相同牌面有这么多的牌 ranks = [card[1:] for card in hand] counter = 0 already_counted = [] for rank in ranks: if rank not in already_counted and \ ranks.count(rank) == n_of_a_kind: counter += 1 already_counted.append(rank) return counter def same_suit(hand): #统计同花牌数量 suits = [card[0] for card in hand] counter = {} # counter[suit]存放suit花色的数量 for suit in suits: count = suits.count(suit) if count > 1: #只记录花色数大于1的 counter[suit] = count return counter N=100000 #实验次数 #计算五张牌中正好两对的概率 def prob_two_pairs(): #----------begin----------- #----------end----------- #五张牌中有四张或五张同一花色的牌的概率 def prob_same_suit(): #----------begin----------- #----------end----------- #计算五张牌中有四张牌面数字相同的牌（四条）的概率 def prob_fourofakind(): #----------begin----------- #----------end----------- print('五张牌中正好两对的概率:%.5f' %prob_two_pairs()) print('五张牌中有四张或五张同一花色的牌的概率:%.5f' %prob_same_suit()) print('五张牌中有四张牌面数字相同的牌（四条）的概率:%.5f' %prob_fourofakind())请补全代码
最新发布
05-30
def same_rank(hand, n_of_a_kind): #分析牌有对或者3-4个 #hand:一手牌，n_of_a_kind：2~4 寻找相同牌面有这么多的牌 ranks = [card[1:] for card in hand] counter = 0 already_counted = [] for rank in ...
java纸牌程序
04-08
Then modify class DeckOfCards of Fig. 7.10 to include methods that determine whether a hand contains a) a pair b) two pairs c) three of a kind (e.g., three jacks) d) four of a kind (e.g., four aces) ...
uva 131 The Psychic Poker Player(直接枚举）
不慌不忙、不急不躁
08-11 1708
The Psychic Poker Player  In 5-card draw poker, a player is dealt a hand of five cards (which may be looked at). The player may then discard between zero and five of his or her cards an
leetcode-914. X of a Kind in a Deck of Cards
天使之翼
03-28 222
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:...
# [LeetCode]914. X of a Kind in a Deck of Cards
weixin_42687983的博客
12-20 175
Question Sample 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. Exa...
914. X of a Kind in a Deck of Cards(Leetcode每日一题-2020.03.27)
Bryan要加油
03-27 227
Problem 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...
LeetCode-914.X of a Kind in a Deck of Cards（C++实现）
qq_38358582的博客
12-01 269
一、问题描述 In a deck of cards, each card has an integer written on it. Return true if and only if you can choose X &gt;= 2 such that it is possible to split the entire deck into 1 or more groups of cards,...
914. X of a Kind in a Deck of Cards*
珍妮的选择的博客
01-03 237
914. X of a Kind in a Deck of Cards* 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 c...
LeetCode周赛#104 Q1 X of a Kind in a Deck of Cards (枚举)
da_kao_la的博客
10-05 294
题目来源：https://leetcode.com/contest/weekly-contest-104/problems/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. R...
【LeetCode】914. X of a Kind in a Deck of Cards 解题报告（Python & C++）
负雪明烛
09-30 2059
作者： 负雪明烛 id： fuxuemingzhu 个人博客： http://fuxuemingzhu.cn/ 题目地址: https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/description/ 题目描述： In a deck of cards, each card has an integer written...
977. Squares of a Sorted Array
心向暖的博客
04-12 391
#include <iostream> #include <algorithm> #include "vector" using namespace std; vector<int> sortedSquares(vector<int>& A) { vector<int>::iterator it; for (it = A...
633. Sum of Square Numbers
心向暖的博客
04-19 288
转换思路，将 转换成 //判断 剩下的数开方后是否是整数。 bool judgeSquareSum(int c) { for (int i = 0; i <= (int)sqrt(c); i++) { int rest = c - i*i; int root = (int)sqrt(rest);//剩下的数开方后...
shuffling is a procedure used to randomize a deck of playing cards. because standard shuffling techn
03-16
iques are not completely random, many casinos employ automatic shuffling machines to ensure fair play.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值