Leetcode 299:Bulls and Cows

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.

Credits:
Special thanks to @jeantimex for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

//你和朋友在玩下面的猜数字游戏（BullsandCows）：你写下一个4位数的神秘数字然后让朋友来猜，
//你的朋友每次猜一个数字，你给一个提示，告诉他有多少个数字处在正确的位置上（称为"bulls"公牛），
//以及有多少个数字处在错误的位置上（称为"cows" 奶牛），你的朋友使用这些提示找出那个神秘数字。
class Solution {
public:
    string getHint(string secret, string guess) {
        int aCnt=0;//公牛的个数
        int bCnt=0;//奶牛的个数
        vector<int> sVec(10,0);
        vector<int> gVec(10,0);
        if(secret.length()!=guess.length() || secret.empty())
            return "0A0B";
        for(int i=0;i<secret.length();++i)
        {
            char c1=secret[i];char c2=guess[i];
            if(c1==c2)
                ++aCnt; //计算公牛的个数
            else
            {
                ++sVec[c1-'0'];
                ++gVec[c2-'0'];
            }
        }
        
        //计算奶牛的个数
        for(int i=0;i<sVec.size();++i)
        {
            bCnt+=min(sVec[i],gVec[i]);
        }
        
        return  to_string(aCnt) + 'A' + to_string(bCnt) + 'B';
    }
};