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";
        }
    }
  • 相关阅读:
    前端代码异常日志收集与监控
    基于window.onerror事件 建立前端错误日志
    MySQL数据类型和常用字段属性总结
    MySQL中char(36)被认为是GUID导致的BUG及解决方案
    dl,dt,dd,ul,li,ol区别
    泛型
    EF里Guid类型数据的自增长、时间戳和复杂类型的用法
    EF里的默认映射以及如何使用Data Annotations和Fluent API配置数据库的映射
    EF里的继承映射关系TPH、TPT和TPC的讲解以及一些具体的例子
    SQL JOIN
  • 原文地址:https://www.cnblogs.com/fatttcat/p/13662413.html
Copyright © 2011-2022 走看看