【Gale Shapley 婚姻稳定匹配算法实现】

原理：

1. 所有男性按照好感的高低向对应女性求婚
2. 每个女性在所有的向她发出求婚的男性和其丈夫（如果暂无丈夫则不做比较）选择一个最喜欢的，如果这个最喜欢的是当前的丈夫，则婚姻关系不变，否则与当前丈夫离婚，并与向她发出求婚请求的男性结婚
3. 在每个女性处理完后，统计是否还有男性单身（被离婚的将加入单身行列），如果有，则重复上述过程，否则结束

注意：每个单身男性会依次按照其对每个女性的好感的从大到小向对应女性求婚，如果求婚过该女性，无论是否当前求婚被接受，后续都将不再向该女性求婚。

由于每个男生最多向每个女生求婚一次，因此最多 $n^2$ 次后，算法将完成，其中 $n$ 是男生和女生的数量。
时间复杂度：$O(n^2)$

代码：

//
// Created by solego on 2022/10/16.
//

#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>
using namespace std;

const int N = 4;
vector<string> girl = {
        "Ada",
        "Becky",
        "Cindy",
        "Diana",
};

vector<string> boy = {
        "Alex",
        "Chris",
        "David",
        "Bob",
};

unordered_map<string, int> girl_id;
unordered_map<string, int> boy_id;

vector<vector<string>> boy_to_girl = {
        {"Ada", "Diana", "Cindy", "Becky"},
        {"Becky", "Diana", "Cindy", "Ada"},
        {"Cindy", "Ada", "Becky", "Diana"},
        {"Ada", "Becky", "Cindy", "Diana"},
};

vector<vector<string>> girl_to_boy = {
        {"Chris", "Alex", "Bob", "David"},
        {"Alex", "David", "Chris", "Bob"},
        {"Bob", "David", "Chris", "Alex"},
        {"David", "Bob", "Alex", "Chris"},
};

int get_priority(const string& girl_name, const string& boy_name) {
    int g_id = girl_id[girl_name];
    for (int i = 0; i < girl_to_boy[g_id].size(); ++i) {
        if (boy_name == girl_to_boy[g_id][i])
            return i;
    }
    return N;
}

void init() {
    for (int i = 0; i < girl.size(); ++i) {
        girl_id[girl[i]] = i;
    }
    for (int i = 0; i < boy.size(); ++i) {
        boy_id[boy[i]] = i;
    }
}

void test() {
    vector<bool> matched_boy(N, false);
    vector<string> girl_matched_boy(N, "");
    auto b2g = boy_to_girl;
    for (auto& u: b2g) reverse(u.begin(), u.end());

    // 每一轮，将每个还未匹配的男生，尝试匹配其当前还未匹配过的，优先级最高的女生
    int sum = 0;
    while (sum < N) {
        vector<vector<string>> girl_new_boy(N, vector<string>());
        for (int i = 0; i < N; ++i) {
            if (!matched_boy[i]) {
                string g_name = b2g[i].back();
                b2g[i].pop_back();

                int g_id = girl_id[g_name];
                girl_new_boy[g_id].push_back(boy[i]);
            }
        }

        for (int i = 0; i < N; ++i) {
            if (girl_new_boy.empty()) continue ;
            for (const auto& b_name: girl_new_boy[i]) {
                if (girl_matched_boy[i].empty()) {
                    matched_boy[i] = true;
                    girl_matched_boy[i] = b_name;
                    sum += 1;
                } else {
                    if (get_priority(girl[i], b_name) < get_priority(girl[i], girl_matched_boy[i])) {
                        matched_boy[ boy_id[b_name] ] = true;
                        matched_boy[ boy_id[girl_matched_boy[i]] ] = false;
                        girl_matched_boy[i] = b_name;
                        // 这里不需要更新sum，因为总共匹配的sum数不变
                    }
                }
            }
        }
    }

    for (int i = 0; i < N; ++i) {
        cout << girl_matched_boy[i] << " get married to " << girl[i] << ".\n";
    }
}

int main()
{
    init();
    test();
    return 0;
}

输出：

Alex get married to Ada.
David get married to Becky.
Bob get married to Cindy.
Chris get married to Diana.