LeetCode 765. 情侣牵手

LeetCode 765. 情侣牵手

并查集

class Solution {
public:
    int minSwapsCouples(vector<int>& row) {
        int n = row.size(), m = n / 2;
        vector<int> p(m);
        for(int i = 0; i < m; i ++) p[i] = i;

        function<int(int)> find = [&](int x) -> int{
            if(p[x] != x) p[x] = find(p[x]);
            return p[x];
        };

        for(int i = 0; i < n; i += 2)
        {
            int a = row[i] / 2, b = row[i + 1] /2;
            int pa = find(a), pb = find(b);
            p[pa] = pb;
        }
        
        int cnt = 0;
        for(int i = 0; i < m; i ++)
            if(p[i] == i)
                cnt ++;

        return m - cnt;
    }
};