LeetCode知识点总结 - 299

LeetCode 299. Bulls and Cows

考点难度
Hash MapMedium
题目

You are playing the Bulls and Cows game with your friend.

You write down a secret number and ask your friend to guess what the number is. When your friend makes a guess, you provide a hint with the following info:

The number of “bulls”, which are digits in the guess that are in the correct position.
The number of “cows”, which are digits in the guess that are in your secret number but are located in the wrong position. Specifically, the non-bull digits in the guess that could be rearranged such that they become bulls.
Given the secret number secret and your friend’s guess guess, return the hint for your friend’s guess.

The hint should be formatted as "xAyB", where x is the number of bulls and y is the number of cows. Note that both secret and guess may contain duplicate digits.

思路

先算B,再算B + C。对于每一个数字,secret和guess里出现次数更小的数就是那个数字的B + C,最后减掉B得到C

答案
class Solution:
    def getHint(self, secret, guess):
        B = sum([x == y for x,y in zip(secret, guess)])
	    count_sec = Counter(secret)
        count_gue = Counter(guess)
        B_C = sum([min(count_sec[elem], count_gue[elem]) for elem in count_sec])
        return str(B) + "A" + str(B_C-B) + "B"
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值