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.
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.
Please note that both secret number and friend's guess may contain duplicate digits.
Example 1:
Input: secret = "1807", guess = "7810"
Output: "1A3B"
Example 2:
Input: secret = "1123", guess = "0111"
Output: "1A1B"
方法1:(比较简单)
先遍历一遍找到位置正确的数字,找到后把两个位置的值改为不同的字母
再遍历一遍利用string的find函数查找是否有不同位置的
class Solution {
public:
string getHint(string secret, string guess) {
int n=secret.size();
int res[2]={0,0};
for(int i=0;i<n;i++){
if(secret[i]==guess[i]){
res[0]++;
secret[i]='a';
guess[i]='A';
}
}
for(int i=0;i<n;i++){
if(guess.find(secret[i])!=-1) {
res[1]++;
guess[guess.find(secret[i])] = 'B';
}
}
return to_string(res[0])+'A'+to_string(res[1])+'B';
}
};
tips:int转化为string to_string(), string查找函数str.find() 找到返回第一个位置,找不到返回-1