Bulls And Cows Problem


Description

LeetCode Problem 299.

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:

1
2
3
4
5
6
Input: secret = "1807", guess = "7810"
Output: "1A3B"
Explanation: Bulls are connected with a '|' and cows are underlined:
"1807"
|
"7810"

Example 2:

1
2
3
4
5
6
7
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.

Example 3:

1
2
Input: secret = "1", guess = "0"
Output: "0A0B"

Example 4:

1
2
Input: secret = "1", guess = "1"
Output: "1A0B"

Constraints:

  • 1 <= secret.length, guess.length <= 1000
  • secret.length == guess.length
  • secret and guess consist of digits only.


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
class Solution {
public:
    string getHint(string secret, string guess) {
        int len = secret.size();
        int bull = 0, cow = 0;
        int digits[10] = {0};
        
        for (int i = 0; i < len; i ++) {
            digits[secret[i] - '0'] ++;
            if (secret[i] == guess[i]) {
                bull ++;
                digits[secret[i] - '0'] --;
            }
        }
        
        
        for (int i = 0; i < len; i ++) {
            if (secret[i] != guess[i]) {
                if (digits[guess[i] - '0'] > 0) {
                    cow ++;
                    digits[guess[i] - '0'] --;
                }
            }
        }
        
        string hint;
        hint = to_string(bull);
        hint += 'A';
        hint += to_string(cow);
        hint += 'B';
        
        return hint;
    }
};




Related Posts

Contains Duplicate Problem

LeetCode 217. Given an integer array nums, return true if...

Contains Duplicate II Problem

LeetCode 219. Given an integer array nums and an integer...

Bulls And Cows Problem

LeetCode 299. You are playing the Bulls and Cows game...

Repeated DNA Sequences Problem

LeetCode 187. The DNA sequence is composed of a series...

Majority Element Problem

LeetCode 169. Given an array nums of size n, return...

Fraction To Recurring Decimal Problem

LeetCode 166. Given two integers representing the numerator and denominator...