题解 | 确定两串乱序同构

#include <array>
#include <cstdint>
class Same {
  public:
    bool checkSam(string stringA, string stringB) {
        // write code here
        std::array<uint64_t,2> ua={0};
        std::array<uint64_t,2>ub={0};
        for (char c : stringA) {
            ua[c/64] |= (1ULL<< c%64);
        }
        for (char c : stringB) {
            ub[c/64] |= (1ULL<< c%64);
          
        }
        return ua[0] == ub[0] && ua[1] == ub[1];


    }
};