LeetCode/solutions/cpp/0299.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
    string getHint(string secans, string guess) {
        int A = 0;
        int B = 0;
        map<char, int> map1;
        map<char, int> map2;

        for (int i = 0; i < secans.length(); i++) {
            if (secans[i] == guess[i])
                A++;
            else {
                map1[secans[i]]++;
                map2[guess[i]]++;
            }
        }

        for (int i = 0; i <= 9; i++)
            B += min(map1['0' + i], map2['0' + i]);

        return to_string(A) + "A" + to_string(B) + "B";
    }
};