Acwing2058. 笨拙的手指

Acwing2058. 笨拙的手指

原题

#include <iostream>
#include <cstring>
#include <algorithm>
#include <unordered_set>


using namespace std;

int get(string a, int b) {
    int res = 0;
    for (int i = 0; i < a.size(); i ++ ) {
        res = res * b + a[i] - '0';
    }
    return res;
}

int main()
{
    string a, b;
    cin >> a >> b;
    
    unordered_set<int> S;
    
    for (auto& c : a) {
        char  t = c;
        for (int i = 0; i < 2; i ++ ) {
            if (i + '0' != c) {
                c = i + '0';
                S.insert(get(a, 2));
                c = t;
            }
        }
    }
    
    for (auto& c : b) {
        char t = c;
        for (int i = 0; i < 3; i ++ ) {
            if (i + '0' != c) {
                c = i + '0';
                int x = get(b, 3);
                if (S.count(x)) {
                    cout << x;
                    return 0;
                }
                c = t;
            }
        }
    }
    
}

• 从a中找所有相差一位的，插入哈希表中
• 在b中找所有相差一位的，查表（注意有唯一解