zoukankan      html  css  js  c++  java
  • LeetCode OJ:Bulls and Cows (公牛与母牛)

    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".

    经典的小游戏,hashtable解决之,代码如下:

     1 class Solution {
     2 public:
     3     string getHint(string secret, string guess) {
     4           unordered_map<char, int> hash;
     5           int countA, countB;
     6           countA = countB = 0;
     7           vector<bool> solved(secret.size(), false);
     8           for(int i = 0; i < secret.size(); ++i){
     9               ++hash[secret[i]];
    10           }
    11           for(int i = 0; i < secret.size(); ++i){
    12               if(secret[i] == guess[i]){
    13                   countA++;
    14                   solved[i] = true;
    15                   --hash[secret[i]];
    16               }
    17           }
    18           for(int i = 0; i < guess.size(); ++i){
    19               if(!solved[i] && hash[guess[i]] > 0){
    20                   countB++;
    21                   --hash[guess[i]];
    22               }
    23           }
    24           return toString(countA) + "A" + toString(countB) + "B";
    25     }
    26 
    27     string toString(int i)
    28     {
    29         stringstream ss;
    30         ss << i;
    31         string tmp;
    32         ss >> tmp;
    33         return tmp;
    34     }
    35 };
  • 相关阅读:
    Qt的.pro文件
    AI_八数码
    安装 MINGW GCC 4.4.0
    VC中应用Excel
    八数码问题_启发搜索
    【收集】【收藏】【转帖】game development resouce
    QT小记之在VS2005中使用QT
    [转文]VS2008 安装 Boost 1.43.0
    搬家到博客园了
    转 暴雪总裁总结游戏十条经验
  • 原文地址:https://www.cnblogs.com/-wang-cheng/p/4989698.html
Copyright © 2011-2022 走看看