题目描述:
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.
解题思路:使用两个大小为10的辅助数组(对应于数字0-9)统计字符串secret和guess中不匹配的digit的数目(即0-9出现的数目),然后把不匹配的digit的数目的最小值相加即为cow
AC代码如下:
class Solution {
public:
string getHint(string secret, string guess) {
string ans;
if (secret.size() == 0 || guess.size() == 0) return ans;
vector<int> si(10, 0);
vector<int> gi(10, 0);
int bull = 0;
int cow = 0;
for (int i = 0; i < secret.size(); ++i){
if (secret[i] == guess[i]){
bull++;
}
else{
si[secret[i] - '0']++;
gi[guess[i] - '0']++;
}
}
for (int i = 0; i < si.size(); ++i){
cow += min(si[i], gi[i]);
}
stringstream sBull;
sBull << bull;
stringstream sCow;
sCow << cow;
ans += sBull.str() + 'A' + sCow.str() + 'B';
return ans;
}
};