leetcode299. Bulls and Cows
来源:互联网 发布:jquery数组转化为json 编辑:程序博客网 时间:2024/05/04 17:18
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.
Credits:
Special thanks to @jeantimex for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
思路
遍历secret和guess,如果secret[i]==guess[i],则bull++
否则将secret[i]和guess[i]分别存在两个字典中作为关键字,value为除了bull外出现的次数,即hash1[secret[i]]++
最后查找hash1和hash2关键字相同的部分,取小值之和为bows
注意返回str方式
class Solution(object): def getHint(self, secret, guess): hash1={} hash2={} bull=0 cows=0 minx=min(len(secret),len(guess)) for i in range(minx): if secret[i]==guess[i]: bull=bull+1 else: hash1.setdefault(secret[i],0) hash1[secret[i]]=hash1[secret[i]]+1 hash2.setdefault(guess[i],0) hash2[guess[i]]=hash2[guess[i]]+1 for i in hash1: if i in hash2: cows=cows+min(hash1[i],hash2[i]) ans="%d%s%d%s"%(bull,'A',cows,'B') return ans
- [leetcode299]Bulls and Cows
- leetcode299. Bulls and Cows
- LeetCode299. Bulls and Cows
- Leetcode299. Bulls and Cows
- leetcode299. Bulls and Cows
- LeetCode299——Bulls and Cows我的解法
- [LeetCode]Bulls and Cows
- [LeetCode] Bulls and Cows
- LeetCode Bulls and Cows
- Bulls and Cows
- leetcode | Bulls and Cows
- Bulls and Cows
- LeetCode:Bulls and Cows
- LeetCode -- Bulls and Cows
- leetcode: Bulls and Cows
- [leetcode]Bulls and Cows
- Bulls and Cows
- Bulls and Cows
- 1428 - Ping pong
- MYSQL5.7.10 ZIP安装
- vector 的基本用法
- 令人不得不佩服的微滤技术
- 什么是游标
- leetcode299. Bulls and Cows
- HDU 2222 Keywords Search AC自动机 小试牛刀
- Python学习视频
- 建网站需要学习的软件有哪些
- afinal 网络差自动重连
- Vector容器中存放结构体类型的变量
- 动态规划-Employment Planning
- 关键字近似搜索(c#以及lua实现版)
- scan流程