LeetCode | 299. Bulls and Cows

最新推荐文章于 2021-11-10 21:38:25 发布

1LOVESJohnny

最新推荐文章于 2021-11-10 21:38:25 发布

阅读量275

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/118370273

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

题目

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.
Example 3:

Input: secret = “1”, guess = “0”
Output: “0A0B”
Example 4:

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.

代码

class Solution {
public:
    string getHint(string secret, string guess) {
        int num_a, num_b;
        num_a = num_b = 0;
        int length = secret.length();
        vector<int> A(10, 0);
        string res = "";
        for(int i = 0; i<length; i++)
        {
            if(secret[i] == guess[i])
            {
                num_a++;
                secret[i] = guess[i] = '#';
            }
        }
        for(int i = 0; i<length; i++)
        {
            if(secret[i] != '#')
                A[secret[i] - '0']++;
        }
        for(int i = 0; i<length; i++)
        {
            if(secret[i] == '#')
                continue;
            if(A[guess[i] - '0'] > 0)
            {
                A[guess[i] - '0']--;
                num_b++;
            }
        }
        res = to_string(num_a) + 'A' + to_string(num_b) + 'B';
        return res;
    }
};