LeetCode知识点总结 - 846

LeetCode 846. Hand of Straights

考点难度
GreedyEasy
题目

Alice has some number of cards and she wants to rearrange the cards into groups so that each group is of size groupSize, and consists of groupSize consecutive cards.

Given an integer array hand where hand[i] is the value written on the ith card and an integer groupSize, return true if she can rearrange the cards, or false otherwise.

思路

用map记录每个card的个数。对于每张卡,数groupsize位,如果有任何一位的个数是0返回false,否则个数-1.

答案
class Solution(object):
    def isNStraightHand(self, hand, groupSize):
        count_map = {}
        for card in hand:
            count_map[card] = count_map.get(card, 0) + 1      
        hand.sort()      
        for i in range(len(hand)):
            if count_map[hand[i]] == 0:
                continue           
            for j in range(groupSize):
                curr_card = hand[i] + j            
                if count_map.get(curr_card, 0) == 0:
                    return False             
                count_map[curr_card] -= 1     
        return True
  • 10
    点赞
  • 8
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值