Bulls and Cows
来源:互联网 发布:java 猜数字游戏 编辑:程序博客网 时间:2024/05/17 04:29
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 are0
, 1
and 7
.)Write a function to return a hint according to the secret number and friend's guess, useA
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.
class Solution {public: string getHint(string secret, string guess) { int n = secret.length(); int a[10] = {0}; int b[10] = {0}; int numA = 0; int numB = 0; for (int i = 0; i < n; i++) { if (secret[i] == guess[i]) { numA++; } else { a[secret[i]-'0']++; b[guess[i]-'0']++; } } for (int i = 0; i < 10; i++) { numB += min(a[i], b[i]); } char aStr[100]; char bStr[100]; sprintf(aStr, "%d", numA); sprintf(bStr, "%d", numB); return string(aStr) + "A" + string(bStr) + "B"; }};
- [LeetCode]Bulls and Cows
- [LeetCode] Bulls and Cows
- LeetCode Bulls and Cows
- [leetcode299]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
- 299. Bulls and Cows
- Bulls and Cows-LeetCode
- Leetcode191: Bulls and Cows
- [Leetcode]Bulls and Cows
- Bulls and Cows
- sed删除匹配行到最后一行
- 碰撞检测之Ray-Plane检测
- 个人进阶之路——安卓蓝牙模块(2)
- mysql-存储引擎
- 在 Java 7 中体会 NIO.2 异步执行的快乐
- Bulls and Cows
- Ajax状态
- 用反问的逻辑分析问题
- Quartz 2D基础
- Pattern
- BitmapImage and image mask的零碎知识点
- c++时间间隔运算
- 第四届_高斯日记
- c++ 两个字符串加减得到相差秒数