文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. Description
2. Solution
- Version 1
1 | class Solution { |
- Version 2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32class Solution {
public:
string getHint(string secret, string guess) {
int bull = 0;
int cow = 0;
int length = secret.length();
map<char, int> secretMap;
map<char, int> guessMap;
for(int i = 0; i < length; i++) {
if(secret[i] == guess[i]) {
bull++;
}
else {
if(secretMap[guess[i]] > 0) {
cow++;
secretMap[guess[i]]--;
}
else {
guessMap[guess[i]]++;
}
if(guessMap[secret[i]] > 0) {
cow++;
guessMap[secret[i]]--;
}
else {
secretMap[secret[i]]++;
}
}
}
return to_string(bull) + "A" + to_string(cow) + "B";
}
};