(LeetCode 299) Bulls and Cows （HashTable）

Q:
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.

题意：这题目看得我…
大意就是给你两串等长数字（字符串形式），让你统计两个字符串里面在相同位置值还相同的数字个数a（bulls），以及虽然位置不同但是存在值相同的数字个数b（cows）,然后返回字符串aAbB.

solution:
当然，最朴素的方法就是暴力搜索，但是你也知道（我就不说）
可以尝试使用HashTable(哈希表)或者HashBullet（哈希桶），可以使得时间消耗小很多。
我都实现了一下，HashTable就是使用一个结构，然后将字符串中的值映射到Table中的相应位置存储起来。这样的话，我们在查找时，使用相同哈希函数，映射到指定位置，然后判断是否相等。里面可能出现哈希冲突等问题需要协调。
HashBullet就是使用一个结构，具有10个空间，第i个空间计数数字i出现在字符串secret中的次数。查找的时候，直接到第i个空间查看计数是否为0即可。

这是HashTable的代码，虽然AC了，但是，时间消耗感人，252ms
(嫌麻烦可以直接看后面HashBullet的代码，间接很多)：

class Solution {
public:
    string getHint(string secret, string guess) {
        int length = secret.length()*4;
        vector<int> hash = vector<int>(length,-1);
        int countA=0;
        int countB=0;
        for(int i=0;i<secret.length();i++){
            if(secret[i]==guess[i]){
                countA++;
                guess[i] ='#';
                continue;
            }
            int temp = secret[i]-'0';
            temp*=2;
            if(hash[temp%length]==-1){
                hash[temp%length]=temp;
            }
            else{
                int t=temp+1;
                while(hash[t%length]!=-1){
                    t++;
                }
                hash[t%length]=temp;
            }
        }
        for(int j=0;j<guess.length();j++){
            if(guess[j]=='#')continue;
            int temp = guess[j]-'0';
            temp*=2;
            if(hash[temp%length]==-1)continue;
            else if(hash[temp%length]==temp){
                countB++;
                hash[temp%length]=-2;
            }
            else{
                int t= temp+1;
                while(hash[t%length]!=temp&&hash[t%length]!=-1){
                    t++;
                }
                if(hash[t%length]==temp){
                    countB++;
                    hash[t%length]=-2;
                }
            }
        }
        char ss[20];
        sprintf(ss,"%dA%dB",countA,countB);
        return ss;
    }
};

这是HashBullet的代码，4ms：

class Solution {
public:
    string getHint(string secret, string guess) {
        vector<int> hash = vector<int>(10,0);
        int countA=0;
        int countB=0;
        for(int i=0;i<secret.length();i++){
            if(secret[i]==guess[i]){
                countA++;
                guess[i]='#';
                continue;
            }else{
                hash[secret[i]-'0']++;
            }
        }

        for(int j=0;j<guess.length();j++){
            if(guess[j]!='#'&&hash[guess[j]-'0']!=0){
                countB++;
                hash[guess[j]-'0']--;
            }
        }
        char ss[20];
        sprintf(ss,"%dA%dB",countA,countB);
        return ss;
    }
};