LeetCode 765. 情侣牵手（并查集）

class Solution {
public:
    void swap(vector<int> & row, int j, int m) {
        for (int i = 0; i < row.size(); i++) {
            if (row[i] == m) {
                int temp = row[i];
                row[i] = row[j];
                row[j] = temp;
            }
        }
    }

    int minSwapsCouples(vector<int>& row) {
        int n = 0;
        for (int i = 0; i < row.size(); i += 2) {
            if (row[i] % 2 == 0) {
                if (row[i + 1] == row[i] + 1) continue;
                else {
                    swap(row, i + 1, row[i] + 1);
                    n++;
                }
            }
            else {
                if (row[i + 1] == row[i] - 1) continue;
                else {
                    swap(row, i + 1, row[i] - 1);
                    n++;
                }
            }
        }
        return n;
    }
};