Leetcode 刷题 - 299 - Bulls and 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.


根据题意,分两步,第一步是为了找出index相同,值也相同的个数;第二步是在第一步的基础上,找出剩下的值相同的个数。

既然需要查询,那么python就用字典dictionary的思路,Java应该是hashmap,hashtable之类。

class Solution(object):
    def getHint(self, secret, guess): # bull is the index and value match, cow is only the value match
        """
        :type secret: str
        :type guess: str
        :rtype: str
        """
        dicS = {}
        dicG = {}

        for i in xrange(len(secret)):
            if secret[i] not in dicS:
                dicS[secret[i]] = [i]
            else:
                dicS[secret[i]].append(i)

            if guess[i] not in dicG:
                dicG[guess[i]] = [i]
            else:
                dicG[guess[i]].append(i)

        cow = bull =0
        for i in dicS:
            if i in dicG:
                tempA = len(set(dicS[i]) & set(dicG[i])) # 用set 的bit操作来找出重复的index
                bull += tempA
                if len(dicG[i]) > tempA: # guess存在非重复的index
                    tempB = len(dicG[i]) - tempA # 找出有几个
                    if len(dicS[i]) - tempA < tempB: # 如果secret的index差大于tempB,那么就是tempB,否则,就是secret剩下的index个数
                        tempB = len(dicS[i]) - tempA
                    cow += tempB

        return "%sA%sB" % (bull, cow)



因为index作为一个list,存在dictionary中作为value。那么代码可以更新如下,把index直接存为一个整型数字。

class Solution(object):
    def getHint(self, secret, guess): # bull is the index and value match, cow is only the value match
        """
        :type secret: str
        :type guess: str
        :rtype: str
        """
        dicS = {}
        dicG = {}
        cow = bull = 0
        for i in xrange(len(secret)):
            if secret[i] == guess[i]: # 如果index,value都相同,直接计数
                bull += 1
            else:
                if secret[i] not in dicS: # 如果仅仅value相同,在字典中用value累加计数
                    dicS[secret[i]] = 1
                else:
                    dicS[secret[i]] += 1
                if guess[i] not in dicG:
                    dicG[guess[i]] = 1
                else:
                    dicG[guess[i]] += 1

        for key in dicG:
            if key in dicS:
                cow += min(dicG[key], dicS[key]) # loop guess的字典,比较两个字典相同key的value,小的数字累加

        return "%sA%sB" % (bull, cow)






  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值