Leetcode299 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.

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.

Please note that both secret number and friend’s guess may contain duplicate digits.

Example 1:
Input: secret = “1807”, guess = “7810”
Output: “1A3B”
Explanation: 1 bull and 3 cows. The bull is 8, the cows are 0, 1 and 7.

Example 2:
Input: secret = “1123”, guess = “0111”
Output: “1A1B”
Explanation: The 1st 1 in friend’s guess is a bull, the 2nd or 3rd 1 is a cow.

思路

题中只使用数字，考虑用长度为10的数组先记录每个数字出现的次数，再次遍历。

1. 若$guess$和$secret$第i位相同则A的数量增加
2. 不相同但$guess$中的数字在$secret$中出现，B增加

看过第i位后减少数组记录的数量。

这样的话有一个问题，$guess$会贪心的匹配$secret$中处在i位后的相同数字，可能会导致$guess[i]=secret[i]$时，数组中记录的个数$rest[i]<=0$。修改在判断相等后再次判断$rest[i]==0$，若成立则B减1。

举例
$secret="0122",guess="2122"$
$guess[0]$会匹配$secret[2]$，$guess[2]$会匹配$secret[3]$，到$i=3$时，此时$A=2$， $B=1$，比较后有$guess[i]=secret[i]$，但因为$rest[2]==0$，得到$A=3$， $B=0$。

代码

public String getHint(String secret, String guess) {
        int A = 0, B = 0;
        int[] rest = new int[10];
        for (int i = 0; i < secret.length(); i++) {
            rest[secret.charAt(i) - '0']++;
        }
        for (int i = 0; i < secret.length(); i++) {
            //System.out.println(rest[guess.charAt(i) - '0']);
            if (secret.charAt(i) == guess.charAt(i)) {
                A++;
                if (rest[guess.charAt(i) - '0'] == 0) {
                    B--; // 前面不对位置的多match了一个
                } else {
                    rest[guess.charAt(i) - '0']--;
                }
            } else {
                if (rest[guess.charAt(i) - '0'] != 0) {
                    B++;
                    rest[guess.charAt(i) - '0']--;
                }
            }
        }
        return String.format("%dA%dB", A, B);
    }

优化

看了一下最快的代码，可以只遍历一遍，用两个数组记录出现频率，$cow$的数量就是在每次遍历的时候比较是否有$guess[i]$存在于$secret$的数组中（与之前位数匹配）， $secret[i]$存在于$guess$的数组中（与之后位数匹配）。

同时$String.format()$比$StringBuilder$多花很多的时间和空间！

修改代码如下

public String getHint(String secret, String guess) {
        int[] secretMap = new int[10];
        int[] guessMap = new int[10];
        int bull = 0;
        int cow = 0;

        for(int i = 0; i < secret.length(); i++) {
            if(secret.charAt(i) == guess.charAt(i)) {
                bull++;
            } else {
                int sDigit = secret.charAt(i) - '0';
                int gDigit = guess.charAt(i) - '0';
                if(guessMap[sDigit] > 0) {
                    guessMap[sDigit]--;
                    cow++;
                } else {
                    secretMap[sDigit]++;
                }
                if(secretMap[gDigit] > 0) {
                    secretMap[gDigit]--;
                    cow++;
                } else {
                    guessMap[gDigit]++;
                }
            }
        }

        StringBuilder sb = new StringBuilder();
        sb.append(bull).append("A").append(cow).append("B");
        return sb.toString();
   }