zoukankan      html  css  js  c++  java
  • 299. 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.

    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. 

    Please note that both secret number and friend's guess may contain duplicate digits.

    Example 1:

    Input: secret = "1807", guess = "7810"
    
    Output: "1A3B"
    
    Explanation: 1 bull and 3 cows. The bull is 8, the cows are 0, 1 and 7

    Example 2:
    Input: secret = "1123", guess = "0111"
    
    Output: "1A1B"
    
    Explanation: The 1st 1 in friend's guess is a bull, the 2nd or 3rd 1 is a cow

    Note: You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.

     

    Approach #1:

    class Solution {
    public:
        string getHint(string secret, string guess) {
            int len = secret.length();
            unordered_set<char> seen;
            unordered_map<char, int> has;
            int bullsNum = 0;
            int cowsNum = 0;
            string ans = "";
            for (int i = 0; i < len; ++i) {
                seen.insert(secret[i]);
                has[secret[i]]++;
            }
            
            for (int i = 0; i < len; ++i) {
                if (secret[i] == guess[i]) {
                    bullsNum++;
                    has[guess[i]]--;
                }
            }
                
            for (int i = 0; i < len; ++i) {
                if (secret[i] != guess[i] && seen.count(guess[i])) {
                    if (has[guess[i]] > 0) {
                        cowsNum++;
                        has[guess[i]]--;
                    }
                }  
            }
            ans = to_string(bullsNum) + "A" + to_string(cowsNum) + "B";
            return ans;
        }
    };
    

      

    Approach #2:

    class Solution {
        public String getHint(String secret, String guess) {
            int bulls = 0;
            int cows = 0;
            int[] numbers = new int[10];
            for (int i = 0; i < secret.length(); ++i) {
                if (secret.charAt(i) == guess.charAt(i)) bulls++;
                else {
                    if (numbers[secret.charAt(i)-'0']++ < 0) cows++;
                    if (numbers[guess.charAt(i)-'0']-- > 0) cows++;
                }
            }
            return bulls + "A" + cows + "B";
        }
    }
    

      

    Approach #3:

    class Solution(object):
        def getHint(self, secret, guess):
            """
            :type secret: str
            :type guess: str
            :rtype: str
            """
            bulls = sum(map(operator.eq, secret, guess))
            both = sum (min(secret.count(x), guess.count(x)) for x in set(guess))
            return '%dA%dB' % (bulls, both - bulls)
    

      

    Time SubmittedStatusRuntimeLanguage
    a few seconds ago Accepted 40 ms python
    9 minutes ago Accepted 3 ms java
    16 minutes ago Accepted 4 ms cpp
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    delphi 缓冲画图(内存画图)解决画图闪烁问题
    多重启动光盘制作
    Delphi源程序格式书写规范
    得到一个数据库的触发器的sql
    Querying Active Directory using .NET classes and LDAP queries(http://www.codeproject.com/dotnet/activedirquery.asp)
    My Friend Blog
    .net good study
    关于javascript的apply和call函数
    Microsoft command
    明基成人礼:巅峰战将营 http://www.cnvn.com.cn/Article/ShowArticle.asp?ArticleID=3172
  • 原文地址:https://www.cnblogs.com/h-hkai/p/9945774.html
Copyright © 2011-2022 走看看