299. Bulls and Cows Medium

         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.

思路:本题简单思路就是判断guess里面有没有secret的数,再看相同的数位置是否对的上。值得注意的是有重复数字,如secret “1,1,2,2”,guess为

“1,2,2,2”,这样的结果是3A0B,而不是3A1B。所以要考虑重复数字的个数来判断A和B的值大小。用hash表来存储guess和secret来达到目的。

class Solution {
public:
    string getHint(string secret, string guess) {
        string result = "";
        if (secret.length() == 0) {
            return result;
        }
        int bull = 0, cows = 0;
        map<char, int>hash, hash2;
        for (int i = 0; i < secret.length(); i++) {
            hash[secret[i]] += 1;
            hash2[guess[i]] += 1;
        }
        for (int i = 0; i < guess.length(); i++) {
            if (!hash[guess[i]]) {
                continue;
            }
            else {
                if (guess[i] == secret[i]) {
                    bull++;
                } else {
                    if (hash2[guess[i]] <= hash[guess[i]])
                    cows++;
                    hash2[guess[i]]--;
                    continue;
                }
                hash2[guess[i]]--;
                hash[guess[i]]--;
            }
        }
        stringstream a, q;
        string b;
        a << bull;
        a >> b;
        string c;
        q << cows;
        q >> c;
        result = b + "A" + c + "B";
        return result;
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值