LeetCode No.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.

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.

====================================================================================
题目链接：https://leetcode.com/problems/bulls-and-cows/

题目大意：相同字符相同位置记为bull，相同字符不同位置记为cows，求bull和cows值。

思路：遍历两个字符串，记录bull，同时用两个map记录不构成bulll的字符对应个数，最后根据映射表统计cows值，计算方法如下：

对每个出现在secret映射表中的字符ch：

1、当guess中统计字符ch的个数小于secret中的字符ch个数时，cows+=guess中统计的ch个数。

2、当guess中统计字符ch的个数大于等于secret中的字符ch个数时，cows+=secret中统计的ch个数。

附上代码：

class Solution {
public:
    string getHint(string secret, string guess) {
        int n = secret.size() , bull = 0 , cows = 0 ;
        map <char,int> m1 , m2 ;
        for ( int i = 0 ; i < n ; i ++ )
        {
            if ( secret[i] == guess[i] )
                bull ++ ;
            else
            {
                m1[secret[i]] ++ ;
                m2[guess[i]] ++ ;
            }
        }
        for ( map <char,int>::iterator it = m1.begin() ; it != m1.end() ; it ++ )
        {
            cows += m2[it -> first] < it -> second ? m2[it -> first] : it -> second ;
        }
        return intToString ( bull ) + "A" + intToString ( cows ) + "B" ;
    }
private :
    string intToString ( int n )
    {
        if ( n == 0 )
            return "0" ;
        string ans = "" ;
        while ( n )
        {
            ans = char ( n % 10 + '0' ) + ans ;
            n /= 10 ;
        }
        return ans ;
    }
};