299. Bulls and Cows

Problem

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.

Solution

最直接的想法，

1. 同时便利两个字符串的相同位置，

   1. ） 如果两个字符相等，numBulls＋＋； 

   2. ） 如果两个字符不等，就用两个map分别记录各个字符出现了多少次；

然后比较 2）得到的map就好了，看看这个guess string  cover了多少secret string

class Solution {
public:
    string getHint(string secret, string guess) {
        int bulls = 0, cows = 0;
        unordered_map<char, int> secretMp, guessMp;
        for( int i = 0; i < secret.size(); i++){
            if(secret[i] == guess[i]) bulls++;
            else{
                secretMp[secret[i]]++;
                guessMp[guess[i]]++;
            }
        }
        for( auto it = secretMp.begin(); it != secretMp.end(); it++){
            if(guessMp.find(it->first) != guessMp.end()){
                int cur = guessMp[it->first] > it->second ? it->second : guessMp[it->first];
                cows += cur;
            }
        }
        return to_string(bulls) + "A" + to_string(cows) + "B";
    }
};

优化 ： 其实不用unorderd_map 来记录，由于数字智能是从0到9，所以用两个 size 为10 的数组纪录就可。

ref https://leetcode.com/discuss/76843/very-easy-solution-using-two-arrays

public class Solution {
public String getHint(String secret, String guess) {
    int temp = 0;
    int bulls = 0;
    int[] nums1 = new int[10];
    int[] nums2 = new int[10];
    for(int i = 0; i < secret.length(); i++){
        char s = secret.charAt(i);
        char g = guess.charAt(i);
        if(s == g){
            bulls++;
        }
        else{
            nums1[s - '0']++;
            nums2[g - '0']++;
        }
    }
    int cows = 0;
    for(int i = 0; i < 10; i++){
        cows += Math.min(nums1[i], nums2[i]);
    }
    String res = bulls + "A" + cows + "B";
    return res;
}