【leetcode题解】【E】【19】299. Bulls and Cows

Bulls and Cows 游戏提示生成器

最新推荐文章于 2025-12-03 23:35:37 发布

原创最新推荐文章于 2025-12-03 23:35:37 发布 · 375 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一个用于实现经典猜数字游戏Bulls and Cows中提示生成功能的Python函数。该函数能够根据玩家猜测的数字与预设的秘密数字进行比较，并返回正确的‘bulls’和‘cows’数量。

You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and position (called "bulls") and how many digits match the secret number but locate in the wrong position (called "cows"). Your friend will use successive guesses and hints to eventually derive the secret number.

For example:

Secret number:  "1807"
Friend's guess: "7810"

Hint: 1 bull and 3 cows. (The bull is 8 , the cows are 0 , 1 and 7 .)

Write a function to return a hint according to the secret number and friend's guess, use A to indicate the bulls and B to indicate the cows. In the above example, your function should return "1A3B".

Please note that both secret number and friend's guess may contain duplicate digits, for example:

Secret number:  "1123"
Friend's guess: "0111"

In this case, the 1st 1 in friend's guess is a bull, the 2nd or 3rd 1 is a cow, and your function should return "1A1B" .

You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.

最开始用集合做cow，有问题

看来只能一点儿点儿来，用程序重复这个过程，就是有点儿笨

class Solution(object):
    def getHint(self, secret, guess):
        s = secret
        g = guess

        ss = list(s)
        gg = list(g)

        bull = 0
        cow = 0
        i = 0
        while i < len(ss):
            if ss[i] == gg[i]:
                bull += 1
                del(ss[i])
                del(gg[i])
                i -= 1
            i += 1
        #print ss,gg

        #cow = len(set(ss) & set(gg))

        i = 0
        while i < len(gg):
            if gg[i] in ss:
                cow += 1
                del(ss[ss.index(gg[i])])
                #i-=1
            #print ss,gg
            i+=1

        return str(bull)+'A'+str(cow)+'B'