Bulls and Cows -- leetcode

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.

解法一，

第一趟，统计bull的个数。以及，对剩余字符出现次数作统计。作单边统计。

第二趟， 用另一边的字符，在上面的统计中进行查找。

class Solution {
public:
    string getHint(string secret, string guess) {
        vector<int> digits(10, 0);
        int bulls = 0, cows = 0;
        for (size_t i=0; i<secret.size(); i++) {
            if (secret[i] == guess[i])
                ++bulls;
            else
                ++digits[secret[i] - '0'];
        }
        
        for (size_t i=0; i<secret.size(); i++) {
            if (secret[i] != guess[i]) {
                if (digits[guess[i] - '0'] > 0) {
                    --digits[guess[i] -'0'];
                    ++cows;
                }
            }
        }
        
        return to_string(bulls) + "A" + to_string(cows) + "B";
    }
};

解法二，

在计算cows时，对上面略作改进。

对两个字符串都作统计。

最后对字符串中出现的字符个数作交集（min)。

与解法一相比，第二趟的循环次数有保证。总是10次。

class Solution {
public:
    string getHint(string secret, string guess) {
        int bulls = 0, cows = 0;
        vector<int> stat_s(10, 0);
        vector<int> stat_g(10, 0);
        for (size_t i=0; i<secret.size(); ++i) {
            if (secret[i] == guess[i]) {
                ++bulls;
            } else {
                ++stat_s[secret[i] - '0'];
                ++stat_g[guess[i] - '0'];
            }
        }
        
        for (size_t i=0; i<stat_s.size(); ++i)
            cows += min(stat_s[i], stat_g[i]);
            
        return to_string(bulls) + "A" + to_string(cows) + "B";
    }
};

解法三，一趟扫描

解法二，在第二趟进行cows的统计。

此次改为，第一趟中进行。

基本思路是，互相抵消。抵消成功，则++ cow

class Solution {
public:
    string getHint(string secret, string guess) {
        int bulls = 0, cows = 0;
        vector<int> stat_s(10, 0);
        vector<int> stat_g(10, 0);
        for (size_t i=0; i<secret.size(); ++i) {
            if (secret[i] == guess[i]) {
                ++bulls;
            } else {
                if (stat_s[guess[i] - '0'] > 0) {
                    ++cows;
                    --stat_s[guess[i] - '0'];
                } else {
                    ++stat_g[guess[i] - '0'];    
                }
                
                if (stat_g[secret[i] - '0'] > 0) {
                    ++cows;
                    --stat_g[secret[i] - '0'];
                } else {
                    ++stat_s[secret[i] - '0'];
                }
            }
        }
            
        return to_string(bulls) + "A" + to_string(cows) + "B";
    }
};

解法四，一趟比较，一个数组

思路同解法三。

用一个数组复用为两个数组。

一字符串中出现的字符，统计次数用正向（正数）表示；另一个字符串中出现的次数用互向（互数）表示。

就如同正电荷，和负电荷。   

互相抵消一次，则找到一个cow。

否则，便积累自身。

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

对比起来，两趟算法，看起来是乎比一趟要差一点。 但是，实际执行时间上看。单趟算法却要更快一些。