Leetcode191: Bulls and Cows
2015-12-10 11:26
344 查看
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:
Hint:
and
(The bull is
the cows are
Write a function to return a hint according to the secret number and friend's guess, use
indicate the bulls and
return
Please note that both secret number and friend's guess may contain duplicate digits, for example:
In this case, the 1st
friend's guess is a bull, the 2nd or 3rd
a cow, and your function should return
You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.
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:
1bull
and
3cows.
(The bull is
8,
the cows are
0,
1and
7.)
Write a function to return a hint according to the secret number and friend's guess, use
Ato
indicate the bulls and
Bto 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
1in
friend's guess is a bull, the 2nd or 3rd
1is
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.
class Solution { public: string getHint(string secret, string guess) { map<char, int> mp; int bull = 0; int cows = 0; int n = secret.size(); for(int i = 0; i < n; i++) { mp[secret[i]]++; } for(int i = 0; i < n; i++) { if(secret[i] == guess[i]) { mp[secret[i]]--; bull++; } } for(int i = 0; i < n; i++) { if(secret[i] != guess[i]) { if(mp[guess[i]] > 0) { cows++; mp[guess[i]]--; } } } string res; res = to_string(bull)+'A'+to_string(cows)+'B'; return res; } };
相关文章推荐
- Spring源码阅读4.1-Aspecjt AOP之获取Adivsor
- 架构师知识体系(4)--互联网架构师必备技能(比你牛B的人比你还努力,你有什么资格不去奋斗)
- TinyOS论文07:MILU :
- FTP HA windows cluster
- Linux 调用FFmpeg截图
- 提高mysql千万级大数据SQL查询优化30条经验(Mysql索引优化注意)
- python:使用socket模块,进行服务器与客户端简单交互
- 网络请求
- 去除源文件中的重复行的程序流程及其C代码实现
- Ecliplse 指定JRE
- CocoaPods
- eclipse使用技巧之 //TODO标识
- php数组函数-array_filter()
- linux sendmail 邮件服务器架设
- 欢迎界面
- 深入理解 Java中的 流 (Stream)
- JS中showModalDialog 详细使用
- jQuery实现监控页面所有ajax请求的方法
- 图片填满屏幕
- Android中声名Handler变量的内存泄露问题