LeetCode 299. Bulls and Cows

分析

难度 中
来源 https://leetcode.com/problems/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.
Note: You may assume that the secret number and your friend’s guess only contain digits, and their lengths are always equal.

解答

Runtime: 1 ms, faster than 100.00% of Java online submissions for Bulls and Cows.
Memory Usage: 36.7 MB, less than 73.05% of Java online submissions for Bulls and Cows.

package LeetCode;

public class L299_BullsAndCows {//公牛母牛游戏。求该如何提示
    public String getHint(String secret, String guess) {//使用桶
        //有多少在位置和大小上与给定字符串一致，bulls
        //有多少大小一致位置不同,cows
        char[] secretChar=secret.toCharArray(),guessChar=guess.toCharArray();
        int bulls=0,cows=0;
        int[] secretNums=new int[10];//存储包含各个数字的个数
        int[] guessNums=new int[10];
        for(int i=0;i<secret.length();i++){
            if(secretChar[i]==guessChar[i]){
                bulls++;
            }else{
                secretNums[secretChar[i]-48]++;
                guessNums[guessChar[i]-48]++;
            }
        }
        for(int i=0;i<10;i++){
            cows+=Math.min(secretNums[i],guessNums[i]);
        }
        return bulls+"A"+cows+"B";
    }
    public static void main(String[]  args){
        L299_BullsAndCows l299=new L299_BullsAndCows();
        String secret = "1807", guess = "7810";
        //String secret = "7151535801", guess = "4604986377";
        //String secret="00112233445566778899",guess="16872590340158679432";
        System.out.println(l299.getHint(secret,guess));
    }
}