LeetCode299——Bulls and Cows我的解法

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

booirror

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

阅读量3.4k

点赞数

CC 4.0 BY-SA版权

分类专栏：面试题算法题文章标签： Leetcode 面试题

本文链接：https://blog.youkuaiyun.com/booirror/article/details/50084093

面试题算法题专栏收录该内容

169 篇文章

订阅专栏

本文详细阐述了一个Bulls and Cows游戏的算法实现，包括如何通过友好的提示来帮助玩家逐步推断出隐藏的数字。文章深入探讨了算法逻辑，提供了具体的代码实例，旨在提高玩家的推理技巧。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

For example:

Secret number: "1807" Friend's guess: "7810" Hint: 1 bull and 3 cows. (The bull is 8, the cows are 0, 1 and 7.) 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. In the above example, your function should return "1A3B".

Please note that both secret number and friend's guess may contain duplicate digits, for example:

Secret number: "1123" Friend's guess: "0111" In this case, the 1st 1 in friend's guess is a bull, the 2nd or 3rd 1 is a cow, and your function should return "1A1B". You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.

实现：

class Solution {
public:
    string getHint(string secret, string guess) {
    int bulls = 0;
    int cows = 0;
    int num[10] = { 0 };
    for (int i = 0; i < guess.size(); i++)
    {
        if (secret[i] == guess[i])
        {
            bulls = bulls + 1;
        }
        else {
            num[guess[i] - '0']++;
        }
    }

    for (int i = 0; i < secret.size(); i++)
    {
        if (secret[i] != guess[i] && num[secret[i] - '0'] > 0)
        {
            cows++;
            num[secret[i] - '0']--;
        }
    }
    char buff[20];
    sprintf(buff, "%dA%dB", bulls, cows);
    return buff;
}
};