LeetCode 299. Bulls and Cows

 1 class Solution {
 2 public:
 3     string getHint(string secret, string guess) {
 4         int s_map[10] = {0}, g_map[10] = {0};
 5         int bull = 0, cow = 0;
 6         
 7         for(int i = 0; i < secret.length(); ++i){
 8             if(secret[i] == guess[i]) ++bull;
 9             else{
10                 ++s_map[secret[i] - ‘0‘];
11                 ++g_map[guess[i] - ‘0‘];
12             }
13         }
14         
15         for(int i = 0; i < 10; ++i){
16             cow += min(s_map[i], g_map[i]);
17         }
18         
19        
20         string res = "";
21         res = to_string(bull) + "A" + to_string(cow) + "B";
22         return res;
23     }
24 };