【LeetCode】299.Bulls and Cows(Medium)解题报告

【LeetCode】299.Bulls and Cows(Medium)解题报告

题目地址： https://leetcode.com/problems/bulls-and-cows/description/
题目描述：

  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.

  题意就是看几位相同，不同的看有几个虽然异位但存在的。注意下面两个if，挺常用的方法。

Solution:

//挺tricky的一个方法
//time : O(n)
//space : O(1)
class Solution {
    public String getHint(String secret, String guess) {
        int bulls = 0;
        int cows = 0;
        int[] count = new int[10];
        for(int i=0 ; i<secret.length() ; i++){
            if(secret.charAt(i) == guess.charAt(i)){
                bulls++;
            }else{
                if(count[secret.charAt(i) - '0']++ <0) cows++;
                if(count[guess.charAt(i) - '0']-- >0) cows++;
            }
        }
        return bulls + "A" + cows + "B";
    }
}   

Date：2018年2月27日