leetcode

0 class Solution {

1 public:

2 string getHint(string secret, string guess) {

3 int n = secret.size(), cows = 0, bulls = 0;

4 unordered_map<char, int> ums;

5 for (int i = 0; i < n; i++)

6 if (guess[i] == secret[i])

7 bulls++;

8 else

9 ums[secret[i]]++;

10

11 for (int i = 0; i < n; i++) {

12 if (guess[i] == secret[i])

13 continue;

14 else if (ums[guess[i]] > 0)

15 cows++;

16 ums[guess[i]]--;

17 }

18 return to_string(bulls) + "A" + to_string(cows) + "B";

19 }

20 };