题目:
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.
题意:与朋友一起根据猜数字(Bulls and Cows),游戏规则:通常由两个人玩,一方出数字,一方猜。出数字的人要想好一个没有重复数字的4个数,不能让猜的人知道。猜的人就可以开始猜。每猜一个数字,出数者就要根据这个数字给出几A几B,其中A前面的数字表示位置正确的数的个数,而B前的数字表示数字正确而位置不对的数的个数。
思路一:
暴力轮训,先找到bulls,再轮训一遍找到cows,用数组记录数字情况。
代码:20ms
class Solution { public: string getHint(string secret, string guess) { int bulls = 0; int cows = 0; unordered_map<char, int> result; vector<bool> tag(secret.size(), false); for(auto s : secret){ ++result[s]; } for(int i=0; i<secret.size(); i++){ if(secret[i]==guess[i]){ bulls++; --result[secret[i]]; tag[i] = true; } } for(int i=0; i<guess.size(); i++){ if(!tag[i] && result[guess[i]] > 0){ cows++; --result[guess[i]]; } } return to_string(bulls) + "A" + to_string(cows) + "B"; } };
思路二:
创建一个包含10个元素的数组,分别用于记录每个数字所遇到的情况。
代码:4ms
public class Solution { public String getHint(String secret, String guess) { int bulls = 0; int cows = 0; int[] nums = new int[10]; for(int i=0; i<secret.length(); i++){ if(secret.charAt(i)==guess.charAt(i)){ bulls++; }else{ if(nums[secret.charAt(i)-'0']++ < 0){ cows++; } if(nums[guess.charAt(i)-'0']-- > 0){ cows++; } } } return bulls + "A" + cows + "B"; } }思路三:
利用两个数组分别保存密码数字,猜的数字情况,之后再判断匹配。
代码:4ms
class Solution { public: string getHint(string secret, string guess) { int bulls = 0; int cows = 0; vector<int> sVec(10, 0); vector<int> gVec(10, 0); for(int i=0; i<secret.size(); i++){ char c1 = secret[i]; char c2 = guess[i]; if(c1==c2){ bulls++; }else{ sVec[c1-'0']++; gVec[c2-'0']++; } } for(int i=0; i<sVec.size(); i++){ cows += min(sVec[i], gVec[i]); } return to_string(bulls) + "A" + to_string(cows) + "B"; } };