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.

记得初中就玩腾讯的这个小游戏的，游戏很简单，假如位置和数字都正确的话则表示bull,如果数字正确位置不对，则表示cow.

初看这道题，首先想到的是用数组，进行操作，竟然浪费了40秒，打败了4.9%。

public class Solution {
    public String getHint(String secret, String guess) {
      	char[] cSecret = secret.toCharArray();
		char[] cGuess  = guess.toCharArray();
	    int cows = 0;
	    int bols = 0;
	    for(int i = 0;i < secret.length();i++){
	    	if(cSecret[i] == cGuess[i]){
	    		bols ++;
	    		cSecret[i] = 'a';
	    		cGuess[i] = 'b';
	    	}
	    }
	    for(int i = 0;i < cGuess.length;i++){
	    	for(int j = 0;j <cSecret.length;j++ ){
	    	    if(cGuess[i] == cSecret[j]){
            		cows ++;
            		cGuess[i] = 'b';
            		cSecret[j] = 'a';
	    	    }
	    	}
	    }
	    return bols+"A"+cows+"B";
    }
}

然而效率太低了，于是改用了HashMap ，打败了32.03%

public class Solution {
    public String getHint(String secret, String guess) {
      	Map<Character,Integer> map = new HashMap<Character,Integer>();
        int length =  secret.length();
        int countBol = 0;
        int countCow = 0;
    	char[] cGuess  = guess.toCharArray();
        for(int i = 0;i < length; i++ ){
        	if(secret.charAt(i) == guess.charAt(i)){
        		countBol ++;
        	    cGuess[i] = 'a';
        	}else{
        		if(map.containsKey(secret.charAt(i))){
        			int count  = map.get(secret.charAt(i))+1;
        			map.put(secret.charAt(i), count);
        		}else{
        			map.put(secret.charAt(i), 1);
        		}
        	}
        }
        for(int j = 0;j < cGuess.length;j++){
        	 char temp = cGuess[j];
        	if(map.containsKey(temp)){
        		int count = map.get(temp);
        		if(count > 0){
        			countCow++;
        			count--;
        			map.put(temp,count);
        		}
        	}
        }
        return countBol+"A"+countCow+"B";
    }
}

但是用这个效率还是有点低的，于是看看别人的想法，发现有更好的想法，我们可以用数组来代替hashMap，3ms，打败了74.88%

public 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";
    }
}

或者其实还有更易于理解的代码

public class Solution {
    public String getHint(String secret, String guess) {
        int len = secret.length();
		int[] secretarr = new int[10];
		int[] guessarr = new int[10];
		int bull = 0, cow = 0;
		for (int i = 0; i < len; ++i) {
			if (secret.charAt(i) == guess.charAt(i)) {
				++bull;
			} else {
				++secretarr[secret.charAt(i) - '0'];
				++guessarr[guess.charAt(i) - '0'];
			}
		}
		for (int i = 0; i < 10; ++i) {
			cow += Math.min(secretarr[i], guessarr[i]);
		}
		return "" + bull + "A" + cow + "B";
    }
}