class Solution {
public:
string getHint(string secret, string guess) {
vector<int> bulls(10), cows(10);
int bull = 0, cow = 0;
int n = secret.size();
for(int i = 0; i < n; ++i){
//一一比较
if(secret[i] == guess[i])
++bull;
else{
++bulls[secret[i] - '0'];
++cows[guess[i] - '0'];
}
}
for(int i = 0; i < 10; ++i)
//应取其在secret和guess中的出现次数的最小值
cow += min(bulls[i], cows[i]);
string ans = to_string(bull) + "A" + to_string(cow) + "B";
return ans;
}
};
Accepted
152/152 cases passed (4 ms)
Your runtime beats 71.93 % of cpp submissions
Your memory usage beats 25.53 % of cpp submissions (6.5 MB)