Leetcode 299 Bulls and Cows

最新推荐文章于 2023-11-11 22:17:18 发布

伊萨卡钢琴家

最新推荐文章于 2023-11-11 22:17:18 发布

阅读量359

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode String

本文链接：https://blog.csdn.net/Hanwenwangad/article/details/50610228

Leetcode 同时被 2 个专栏收录

104 篇文章

订阅专栏

String

14 篇文章

订阅专栏

本文介绍了一个基于 Bulls and Cows 游戏的算法实现，通过使用哈希表来记录数字出现的位置和次数，高效地计算出猜测与秘密数字之间的 bulls 和 cows 数量。

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

You are playing the following Bulls and Cows game with your friend: You write a 4-digit secret number and ask your friend to guess it, each time your friend guesses a number, you give a hint, the hint tells your friend how many digits are in the correct positions (called "bulls") and how many digits are in the wrong positions (called "cows"), your friend will use those hints to find out 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.)

The idea is from here. It is quite obvious to use hashtable to solve his problem, the tricky part is that use the negative and positive number to push the character into the hashtable and record how many cows it appear

class Solution {
public:
    string getHint(string secret, string guess) {
        int m[256] = {0}, bulls = 0, cows = 0;
        for (int i = 0; i < secret.size(); ++i) {
            if (secret[i] == guess[i]) ++bulls;
            else ++m[secret[i]];
        }
        for (int i = 0; i < secret.size(); ++i) {
            if (secret[i] != guess[i] && m[guess[i]]) {
                ++cows;
                --m[guess[i]];
            }
        }
        return to_string(bulls) + "A" + to_string(cows) + "B";
    }
};