欢乐斗地主 C++/Qt 工程化实践：分层架构、牌型算法与跨线程纪律

enum BombType { NO_BOMB, NORMAL_BOMB, ROYAL_BOMB };

BombType detectBomb(const std::vector<Card>& hand) {
    std::map<int, int> freq;
    for (const auto& c : hand) freq[c.rank()]++;
    if (freq.count(16) && freq.count(17)) return ROYAL_BOMB; // 大小王
    for (const auto& [rank, cnt] : freq)
        if (cnt == 4) return NORMAL_BOMB; // 普通炸弹
    return NO_BOMB;
}

bool findAirplaneWithWings(std::map<int, int>& freq, int minLength = 2) {
    std::vector<int> tripleRanks;
    for (const auto& [rank, cnt] : freq)
        if (cnt >= 3 && rank >= 3 && rank <= 14) tripleRanks.push_back(rank);
    std::sort(tripleRanks.begin(), tripleRanks.end());

    for (size_t i = 0; i <= tripleRanks.size() - minLength; ++i) {
        int start = tripleRanks[i], len = 0;
        for (int r = start; r <= 14; ++r) {
            if (std::find(tripleRanks.begin(), tripleRanks.end(), r) != tripleRanks.end())
                ++len;
            else break;
        }
        if (len < minLength) continue;

        auto remaining = freq;
        for (int r = start; r < start + len; ++r) remaining[r] -= 3;
        int wingsNeeded = len, singles = 0;
        for (const auto& [rank, cnt] : remaining)
            if (cnt > 0 && rank <= 15) singles += cnt;
        if (singles >= wingsNeeded) return true;
    }
    return false;
}