[LeetCode][Array] 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.
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.

Solution 1:

// 将secret中不满足位置和数字都相同的数存入另一个数组中
//该数组的特点是：数字i存放在index为i的位置上
class Solution {
    public String getHint(String secret, String guess) {
        int arr[] = new int[10]; // 构造伪hash来存放数组中的数字，0-9分别存放在对应的index中
        int a = 0;
        int b = 0;
        for(int i = 0; i < guess.length(); i++) {
            if(secret.charAt(i) == guess.charAt(i)) {
                a++;
            } else {
                arr[secret.charAt(i) - '0']++;//将数字放入对应位置
            }
        }
        
        for(int i = 0; i < guess.length(); i++) {
            if (secret.charAt(i) != guess.charAt(i) && arr[guess.charAt(i) - '0'] > 0) {
                b++;
                arr[guess.charAt(i) - '0']--;//寻找guess中的数字是否在对应的位置上
            }
        }
        return a + "A"+ b + "B";
    }
}

Solution 2:

class Solution {
    public String getHint(String secret, String guess) {
        // 将secret和guess中不同的数分别装在不同的array中
        int arrS[] = new int[10];
        int arrG[] = new int[10];
        int a = 0;
        int b = 0;
        for (int i = 0; i < secret.length(); i++) {
            if(secret.charAt(i) == guess.charAt(i)) {
                a++;
            } else {
                arrS[secret.charAt(i) - '0']++;
                arrG[guess.charAt(i) - '0']++;
            } 
        }
        
        for(int i = 0; i < 10; i++) {
            if(arrS[i] == arrG[i]) {
                b+=arrS[i];
            } else {
                b += Math.min(arrS[i], arrG[i]);
            }
        }
        return a + "A" + b + "B";
    }
}