关于LeetCode中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.

    题目由于给了例子还算是通俗易懂，直接上已Accepted的代码了：

    public String getHint(String secret, String guess) {
        int[] hash_map = new int[10];
        int length = secret.length();
        int bulls = 0;
        int cows = 0;
        String result;
        // init hash map and definite bulls
        for(int j=0;j<length;j++){
            hash_map[Character.getNumericValue(secret.charAt(j))]++;
            int guess_char_num = Character.getNumericValue(guess.charAt(j));
            if(Character.getNumericValue(secret.charAt(j))==guess_char_num){
                bulls++;
                hash_map[guess_char_num]--;
            }
        }
        // definite cows
        for(int j=0;j<length;j++){
            int guess_char_num = Character.getNumericValue(guess.charAt(j));
            if(Character.getNumericValue(secret.charAt(j))!=guess_char_num){
                if(hash_map[guess_char_num]>0){
                    cows++;
                    hash_map[guess_char_num]--;
                }
            }
        }
        // construct result
        result = bulls+"A"+cows+"B";
        return result;
    }

    稍微需要注意的就是secret＝“1122”，guess＝“1222”这种情况，guess中第一次出现的‘2’不是cow，因为guess后面还有两个‘2’，而且都是bull。

    然后是评论区的回答，这是一个只需要进行一次循环的答案，地址在这里：https://discuss.leetcode.com/topic/28463/one-pass-java-solution，代码如下所示：

public String getHint(String secret, String guess) {
    int bulls = 0;
    int cows = 0;
    int[] numbers = new int[10];
    for (int i = 0; i<secret.length(); i++) {
        int s = Character.getNumericValue(secret.charAt(i));
        int g = Character.getNumericValue(guess.charAt(i));
        if (s == g) bulls++;
        else {
            if (numbers[s] < 0) cows++;
            if (numbers[g] > 0) cows++;
            numbers[s] ++;
            numbers[g] --;
        }
    }
    return bulls + "A" + cows + "B";
}

    今天身体不适，就写这么多吧。