zoukankan      html  css  js  c++  java
  • LeetCode-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 0, 1 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.

    Credits:
    Special thanks to @jeantimex for adding this problem and creating all test cases.

     
     Solution:
    public class Solution {
        public String getHint(String secret, String guess) {
            if (secret.length()==0) return "0A0B";
            
            int[] sCount = new int[10];
            int[] gCount = new int[10];
            int bulls = 0, cows = 0;
            char[] sArr = secret.toCharArray();
            char[] gArr = guess.toCharArray();
            for (int i=0;i<sArr.length;i++)
                if (sArr[i]==gArr[i]){
                    bulls++;
                } else {
                    sCount[sArr[i]-'0']++;
                    gCount[gArr[i]-'0']++; 
                }
                
            for (int i=0;i<10;i++){
                cows += Math.min(sCount[i],gCount[i]);
            }
            
            StringBuilder builder = new StringBuilder().append(bulls).append('A').append(cows).append('B');
            return builder.toString();
        }
    }
  • 相关阅读:
    使用 linux kernel +busybox 定制linux系统
    记一次golang的内存泄露
    关于Queries_per_sec 性能计数器
    NUMA导致的MySQL服务器SWAP问题分析
    Drop Table对MySQL的性能影响分析
    当MySQL数据库遇到Syn Flooding
    tcp_tw_recycle参数引发的数据库连接异常
    一例数据同步异常问题分析
    MySQL大量线程处于Opening tables的问题分析
    MySQL DeadLock故障排查过程
  • 原文地址:https://www.cnblogs.com/lishiblog/p/5870492.html
Copyright © 2011-2022 走看看