@@ -0,0 +1,42 @@
+#include <algorithm>
+#include <vector>
+#include <unordered_map>
+#include <iostream>
+using namespace std;
+
+class Solution {
+public:
+string getHint(string secret, string guess) {
+const int len = secret.size();
+unordered_map<char, int> dict;
+for (auto& ch : secret)
+{
+dict[ch]++;
+}
+int total = 0;
+for (auto& ch : guess)
+{
+if (dict[ch] > 0)
+total++;
+dict[ch]--; /* 当前字符用1次后, 就从哈希表中删掉它 */
+}
+int bulls = 0;
+for (int i = 0; i < len; i++)
+{
+if (secret[i] == guess[i]) /* 对比两个字符串, 统计位置相同的字符的数量 */
+bulls++;
+}
+return to_string(bulls) + "A" + to_string(total - bulls) + "B";
+}
+};
+
+// Test
+int main()
+{
+Solution sol;
+string secret = "1122", guess = "2211";
+auto res = sol.getHint(secret, guess);
+cout << res << endl;
+
+return 0;
+}

@@ -0,0 +1,44 @@
+#include <algorithm>
+#include <vector>
+#include <unordered_map>
+#include <iostream>
+#include <cstring>
+using namespace std;
+
+class Solution {
+public:
+string getHint(string secret, string guess) {
+const int len = secret.size();
+int dict[11]; /* 数组模拟哈希表, 由于全是数字, 所以哈希表的key是0~9, 共10个, 预留1个 */
+memset(dict, 0, sizeof(dict));
+for (auto& ch : secret)
+{
+dict[ch - '0']++;
+}
+int total = 0;
+for (auto& ch : guess)
+{
+if (dict[ch - '0'] > 0)
+total++;
+dict[ch - '0']--; /* 当前字符用1次后, 就从哈希表中删掉它 */
+}
+int bulls = 0;
+for (int i = 0; i < len; i++)
+{
+if (secret[i] == guess[i]) /* 对比两个字符串, 统计位置相同的字符的数量 */
+bulls++;
+}
+return to_string(bulls).append("A") + to_string(total - bulls).append("B");
+}
+};
+
+// Test
+int main()
+{
+Solution sol;
+string secret = "1122", guess = "2211";
+auto res = sol.getHint(secret, guess);
+cout << res << endl;
+
+return 0;
+}

@@ -1,6 +1,5 @@
 #include <algorithm>
 #include <vector>
-#include <unordered_map>
 #include <iostream>
 using namespace std;