LeetCode-765 情侣牵手

public class Solution {

    public int minSwapsCouples(int[] row) {
        int length = row.length;
        int N = length / 2;
        UnionFind uf = new UnionFind(N);
        for (int i = 0; i < length; i += 2) {
            uf.union(row[i] / 2, row[i + 1] / 2);
        }
        return N - uf.getCount();
    }

    private class UnionFind {
        private int[] parent;
        private int count;
        public int getCount() {
            return count;
        }
        public UnionFind(int n) {
            this.count = n;
            this.parent = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
            }
        }
        public int find(int x) {
            while (x != parent[x]) {
                parent[x] = parent[parent[x]];
                x = parent[x];
            }
            return x;
        }
        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);
            if (rootX == rootY) {
                return;
            }
            parent[rootX] = rootY;
            count--;
        }
    }
}