299. Bulls and Cows(哈希表的应用)

problems:

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”

Explanation: 1 bull and 3 cows. The bull is 8, the cows are 0, 1 and 7.

Example 2:

Input: secret = “1123”, guess = “0111”

Output: “1A1B”

Explanation: The 1st 1 in friend’s guess is a bull, the 2nd or 3rd 1 is a cow.

tip:

两个人玩猜数字游戏，一个人给出一个数字字符串，另一个人去猜。猜的数字中与给出数字大小和位置都一样的为bulls，只大小相同位置不同的为cows。这种对应的问题，一般用哈希表求解。

solution:

1.使用双循环，哈希表中存储数字出现的次数。

class Solution {
public:
    string getHint(string secret, string guess) {
        string s = secret;
        string g = guess;
        int bulls = 0;
        int cows = 0;
        int n = secret.size();
        unordered_map<int,int> m;
        for(int i=0;i<n;i++)
        {
            if(s[i] == g[i]) bulls++;
            else
                m[s[i]]++;//存储数字出现的次数
        }
        for(int i=0;i<n;i++)
        {
            if(s[i] != g[i] && m[g[i]])//判断数字是否出现
            {
                ++cows;
                --m[g[i]];
            }
        }
        return to_string(bulls)+"A"+to_string(cows)+"B";
    }
};

2.没理解的方法：

class Solution {
public:
    string getHint(string secret, string guess) {
        int m[256] = {0}, bulls = 0, cows = 0;
        for (int i = 0; i < secret.size(); ++i) {
            if (secret[i] == guess[i]) ++bulls;
            else {
                if (m[secret[i]]++ < 0) ++cows; //？？？？？
                if (m[guess[i]]-- > 0) ++ cows;
            }
        }
        return to_string(bulls) + "A" + to_string(cows) + "B";
    }
};