关闭

299. Bulls and Cows

104人阅读 评论(0) 收藏 举报
分类:

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 01 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判断出现的次数,如果有出现判断是否在对应位置,如果是 bull++.

再遍历两个map,sum+=min(m[i],m2[i]);

class Solution {
public:
    string getHint(string secret, string guess) {
        int len=secret.size();
        int bull=0;
        int cow=0;
        if (len==0) return NULL;
        map<char,int> m;
        map<char,int> m2;
        for(int i=0;i<len;i++){
            m[secret[i]]++;
        }
         for(int i=0;i<len;i++){
             m2[guess[i]]++;
             if(m[guess[i]] && (guess[i]==secret[i]))
                bull+=1;
         }
         int sum=0;
         for (int i=0;i<m.size();i++){
             sum+=min(m[i],m2[i]);
         }
        
        char buff[20];
        sprintf(buff, "%dA%dB", bull, sum-bull);
        return buff;
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:23179次
    • 积分:530
    • 等级:
    • 排名:千里之外
    • 原创:30篇
    • 转载:2篇
    • 译文:0篇
    • 评论:12条
    文章分类
    最新评论