Bulls and Cows leetcode
2016-01-30 12:41
281 查看
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:
Write a function to return a hint according to the secret number and friend's guess, use
Please note that both secret number and friend's guess may contain duplicate digits, for example:
In this case, the 1st
You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.
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.
string getHint(string secret, string guess) { int bull = 0; int cow = 0; if (secret.size() != guess.size() || secret.empty()) { return "0A0B"; } vector<int> map(10, 0); for (int i = 0; i < guess.length(); ++i) { if (secret[i] == guess[i]) bull++; else map[secret[i] - '0']++; } for (int i = 0; i < guess.length(); ++i) { if (secret[i] != guess[i] && map[guess[i] - '0'] > 0) { cow++; map[guess[i] - '0']--; } } return to_string(bull) + "A" + to_string(cow) + "B"; }
相关文章推荐
- HDOJ 2846 Repository (字典树变形)
- 简单使用SQL Server中的Trace Flags
- [LeetCode]Pascal's Triangle II
- phpstorm使用技巧
- Android中自定义RatingBar(评分控件)的方法
- 引用
- 孵化 Docker 的 PaaS 平台 DotCloud 即将关闭
- NameNode启动过程详细剖析
- poj 2242 The Circumference of the Circle
- Asp.net生成静态网页的实现代码
- BZOJ 1024 SCOI2009 生日快乐 暴力搜索
- android录音 MediaRecorder类的使用简介
- HDOJ 1042 N!
- 动态内存分配
- 线程知识
- XenServer部署系列——网络配置
- RecyclerView android:layout_width="match_parent" 无效
- javascript --- 事件托付
- 函数指针
- NameNode启动过程