博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Leetcode题目:Bulls and Cows
阅读量:5945 次
发布时间:2019-06-19

本文共 2291 字,大约阅读时间需要 7 分钟。

题目:

You are playing the following 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.

 

题目解答:这个题目在实现的时候,代码写的比较复杂。首先,需要统计二者共同拥有的字母的个数。使用了两个map结构。应为B的数目中是不包括A的,还需要将对的数字在对的位置的这种情况减去。

代码如下:

class Solution {

public:
    string getHint(string secret, string guess) {
        map<char,int> B_map;
        map<char,int> B_map2;
        int A_count = 0;
        int B_count = 0;
        int len = secret.length();
        if((secret == "") || (guess == "") || (secret.length() != guess.length()))
            return "";
        for(int i = 0;i < len;i++)
        {
            if(B_map.find(secret[i]) == B_map.end())
                B_map[secret[i]] = 1;
            else
                B_map[secret[i]]++;
        }
        for(int i = 0;i < len;i++)
        {
            if(secret[i] == guess[i])
            {
                A_count++;
                B_map[secret[i]]--;
            }
            else
            {
                if(B_map2.find(guess[i]) == B_map2.end())
                    B_map2[guess[i]] = 1;
                else
                    B_map2[guess[i]]++;
            }
        }
        map<char,int>::iterator mit = B_map.begin();
        while(mit != B_map.end())
        {
            if(mit -> second > 0)
            {
                if(B_map2.find(mit -> first) != B_map2.end())
                {
                    int tmp =min(mit -> second , B_map2[mit -> first] );
                    B_count += tmp;
                }
            }
            mit++;
        }
       
        stringstream res;
        res.clear();
        res << A_count << 'A' << B_count <<'B';
        return res.str();
    }
   
    int min(int a, int b)
    {
        return a < b ? a : b;
    }
};

转载于:https://www.cnblogs.com/CodingGirl121/p/5418300.html

你可能感兴趣的文章
Spring(十八):Spring AOP(二):通知(前置、后置、返回、异常、环绕)
查看>>
CentOS使用chkconfig增加开机服务提示service xxx does not support chkconfig的问题解决
查看>>
微服务+:服务契约治理
查看>>
save
查看>>
Android DrawLayout + ListView 的使用(一)
查看>>
clear session on close of browser jsp
查看>>
关于吃掉物理的二次聚合无法实现的需要之旁门左道实现法
查看>>
mysql出现unblock with 'mysqladmin flush-hosts'
查看>>
oracle exp/imp命令详解
查看>>
开发安全的 API 所需要核对的清单
查看>>
Mycat源码中的单例模式
查看>>
WPF Dispatcher介绍
查看>>
fiddler展示serverIP方法
查看>>
已释放的栈内存
查看>>
Android网络之数据解析----SAX方式解析XML数据
查看>>
Java递归列出所有文件和文件夹
查看>>
[关于SQL]查询成绩都大于80分的学生
查看>>
Delphi(Tuxedo,BDE,ADO)三合一数据集组件HsTxQuery
查看>>
LeetCode - Longest Common Prefix
查看>>
Android图片处理
查看>>