Welcome to Subscribe On Youtube
299. Bulls and Cows
Description
You are playing the Bulls and Cows game with your friend.
You write down a secret number and ask your friend to guess what the number is. When your friend makes a guess, you provide a hint with the following info:
- The number of "bulls", which are digits in the guess that are in the correct position.
- The number of "cows", which are digits in the guess that are in your secret number but are located in the wrong position. Specifically, the non-bull digits in the guess that could be rearranged such that they become bulls.
Given the secret number secret
and your friend's guess guess
, return the hint for your friend's guess.
The hint should be formatted as "xAyB"
, where x
is the number of bulls and y
is the number of cows. Note that both secret
and guess
may contain duplicate digits.
Example 1:
Input: secret = "1807", guess = "7810" Output: "1A3B" Explanation: Bulls are connected with a '|' and cows are underlined: "1807" | "7810"
Example 2:
Input: secret = "1123", guess = "0111" Output: "1A1B" Explanation: Bulls are connected with a '|' and cows are underlined: "1123" "1123" | or | "0111" "0111" Note that only one of the two unmatched 1s is counted as a cow since the non-bull digits can only be rearranged to allow one 1 to be a bull.
Constraints:
1 <= secret.length, guess.length <= 1000
secret.length == guess.length
secret
andguess
consist of digits only.
Solutions
-
class Solution { public String getHint(String secret, String guess) { int x = 0, y = 0; int[] cnt1 = new int[10]; int[] cnt2 = new int[10]; for (int i = 0; i < secret.length(); ++i) { int a = secret.charAt(i) - '0', b = guess.charAt(i) - '0'; if (a == b) { ++x; } else { ++cnt1[a]; ++cnt2[b]; } } for (int i = 0; i < 10; ++i) { y += Math.min(cnt1[i], cnt2[i]); } return String.format("%dA%dB", x, y); } }
-
class Solution { public: string getHint(string secret, string guess) { int x = 0, y = 0; vector<int> cnt1(10); vector<int> cnt2(10); for (int i = 0; i < secret.size(); ++i) { int a = secret[i] - '0', b = guess[i] - '0'; if (a == b) ++x; else { ++cnt1[a]; ++cnt2[b]; } } for (int i = 0; i < 10; ++i) y += min(cnt1[i], cnt2[i]); return to_string(x) + "A" + to_string(y) + "B"; } };
-
class Solution: def getHint(self, secret: str, guess: str) -> str: x = y = 0 cnt1 = [0] * 10 cnt2 = [0] * 10 for i in range(len(secret)): if secret[i] == guess[i]: x += 1 else: cnt1[int(secret[i])] += 1 cnt2[int(guess[i])] += 1 for i in range(10): y += min(cnt1[i], cnt2[i]) return f'{x}A{y}B'
-
func getHint(secret string, guess string) string { x, y := 0, 0 cnt1 := make([]int, 10) cnt2 := make([]int, 10) for i := 0; i < len(secret); i++ { a, b := secret[i]-'0', guess[i]-'0' if a == b { x++ } else { cnt1[a]++ cnt2[b]++ } } for i := 0; i < 10; i++ { y += min(cnt1[i], cnt2[i]) } return fmt.Sprintf("%dA%dB", x, y) }
-
class Solution { /** * @param String $secret * @param String $guess * @return String */ function getHint($secret, $guess) { $cntA = 0; $cntB = 0; $len = strlen($secret); for ($i = 0; $i < $len; $i++) { if ($secret[$i] == $guess[$i]) { $cntA++; } else { $hashtable[$secret[$i]] += 1; } } for ($i = 0; $i < $len; $i++) { if ($secret[$i] != $guess[$i] && $hashtable[$guess[$i]] > 0) { $cntB++; $hashtable[$guess[$i]] -= 1; } } return $cntA . 'A' . $cntB . 'B'; } }
-
function getHint(secret: string, guess: string): string { const cnt1: number[] = Array(10).fill(0); const cnt2: number[] = Array(10).fill(0); let x: number = 0; for (let i = 0; i < secret.length; ++i) { if (secret[i] === guess[i]) { ++x; } else { ++cnt1[+secret[i]]; ++cnt2[+guess[i]]; } } let y: number = 0; for (let i = 0; i < 10; ++i) { y += Math.min(cnt1[i], cnt2[i]); } return `${x}A${y}B`; }