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.

    在处理不是bulls的位置时,我们看如果secret当前位置数字的映射值
    (1) 如果secret当前位置数字的映射值小于0,则表示其在guess中出现过,cows自增1,然后映射值加1
    (2) 如果guess当前位置的数字的映射值大于0,则表示其在secret中出现过,cows自增1,然后映射值减1

    time = O(n), space = O(1)

    class Solution {
        // map[secret.charAt(i)-'0'] < 0 only if this character appeared in the guess more times then in the secret 
        // which means this character in the secret can be matched with one of the previous characters in the guess
        public String getHint(String secret, String guess) {
            int bulls = 0, cows = 0;
            int[] map = new int[10];
            for(int i = 0; i < secret.length(); i++) {
                if(secret.charAt(i) == guess.charAt(i)) {
                    bulls++;
                } else {
                    if(map[secret.charAt(i) - '0']++ < 0) {
                        cows++;
                    }
                    if(map[guess.charAt(i) - '0']-- > 0) {
                        cows++;
                    }
                }
            }
            return bulls + "A" + cows + "B";
        }
    }
  • 相关阅读:
    CentOS下Zabbix安装部署及汉化
    用jmeter通过ssl验证访问https
    VMware安装CentOS时,无法以图形界面安装解决办法
    MySQL数据库不能远程访问的解决办法
    CentOS搭建LNMP环境
    jstack+top定位性能问题
    用Fiddler模拟低速网络环境
    Linux下history命令用法
    Jmeter3.0发布,版本更新都更新了什么
    【转】gc日志分析工具
  • 原文地址:https://www.cnblogs.com/fatttcat/p/13662413.html
Copyright © 2011-2022 走看看