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.

自己的hashmap方法如下，比较普通，可以跳过看后面的。

public class Solution {
    public String getHint(String secret, String guess) {
        if (secret.length() == 0 || guess.length() == 0) {
            return "0A0B";
        }
        int bull = 0, cow = 0;
        HashMap<Character, Integer> hs = new HashMap<Character, Integer>();
        for (int i = 0; i < secret.length(); i ++) {
            if (hs.containsKey(secret.charAt(i))) {
                hs.put(secret.charAt(i), hs.get(secret.charAt(i)) + 1);
            } else {
                 hs.put(secret.charAt(i), 1);
            }
        }
        for (int j = 0; j < guess.length(); j ++) {
            if (guess.charAt(j) == secret.charAt(j)) {
                bull ++;
                hs.put(guess.charAt(j), hs.get(guess.charAt(j)) - 1);
                if (hs.get(guess.charAt(j)) < 0) {
                    cow = cow + hs.get(guess.charAt(j));
                    hs.put(guess.charAt(j), 0);
                }
            } else {
                if (hs.containsKey(guess.charAt(j)) && hs.get(guess.charAt(j)) > 0) {
                    cow ++;
                    hs.put(guess.charAt(j), hs.get(guess.charAt(j)) - 1);
                }
            }
        }
        String result = bull + "A" + cow + "B";
        return result;
    }
}

下面这个解法有意思，创建int[10]的数组，当secret出现相应数时，对应位++，当guess出现相应数时，对应位--，如果secret对应位小于0时，说明之前有guess需要这个数，如果guess对应位大于0，说明之前secret出现过这个数。

The idea is to iterate over the numbers in secret and in guess and count all bulls right away. For cows maintain an array that stores count of the number appearances in secret and in guess. Increment cows when either number from secret was already seen in guest or vice versa.

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";
}

A slightly more concise version:

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++) {
        if (secret.charAt(i) == guess.charAt(i)) bulls++;
        else {
            if (numbers[secret.charAt(i)-'0']++ < 0) cows++;
            if (numbers[guess.charAt(i)-'0']-- > 0) cows++;
        }
    }
    return bulls + "A" + cows + "B";
}

还有这个，创建两个int[10]数组分别存储secret和guess，如果两者相等，什么都不做，如果不等，secret和guess对映位++，最后累加secret和guess对应位较小的即可。

public class Solution {
    public String getHint(String secret, String guess) {
        int len = secret.length();
		int[] secretarr = new int[10];
		int[] guessarr = new int[10];
		int bull = 0, cow = 0;
		for (int i = 0; i < len; ++i) {
			if (secret.charAt(i) == guess.charAt(i)) {
				++bull;
			} else {
				++secretarr[secret.charAt(i) - '0'];
				++guessarr[guess.charAt(i) - '0'];
			}
		}
		for (int i = 0; i < 10; ++i) {
			cow += Math.min(secretarr[i], guessarr[i]);
		}
		return "" + bull + "A" + cow + "B";
    }
}