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.

好做，但是容易错，统计A和统计B应该分开，优先统计A了之后再统计B，统计A的同时还要记录A的位置，在统计B的时候应该要跳过

AB要分开统计是因为：

"1122"

"1222"

到guese数组的第一个2时，统计成了B，2count--，这样A的份额会少一个，或者B会多了一个

要记录A的位置是因为：

"11"

"10"

第二次来算多少B的时候会多统计一个

 1 public class Solution {
 2     public String getHint(String secret, String guess) {
 3         StringBuffer res = new StringBuffer();
 4         int bulls=0, cows=0;
 5         int[] summary = new int[10];
 6         HashSet<Integer> matched = new HashSet<Integer>();
 7         for (int i=0; i<secret.length(); i++) {
 8             char c = secret.charAt(i);
 9             summary[(int)(c - '0')]++;
10         }
11         for (int k=0; k<guess.length(); k++) {
12             char d = guess.charAt(k);
13             if (d == secret.charAt(k)) {
14                 bulls++;
15                 summary[(int)(d - '0')]--;
16                 matched.add(k);
17             }
18         }
19         for (int k=0; k<guess.length(); k++) {
20             if (matched.contains(k)) continue;
21             char d = guess.charAt(k);
22             if (summary[(int)(d - '0')] > 0) {
23                 cows++;
24                 summary[(int)(d - '0')]--;
25             }
26         }
27         res.append(bulls);
28         res.append('A');
29         res.append(cows);
30         res.append('B');
31         return res.toString();
32     }
33 }