solution/0700-0799/0765.Couples Holding Hands/Solution.py at main

main

leetcode-clojure

403 issues
2 pull requests
5,000 files
1 active branch

List view

solution\0700-0799\0765.Couples Holding Hands\Solution.py

3 Complexity
3 Complexity / M
0 Duplication
1 Churn
13 Lines
12 Lines of Code
1 Methods
12 LOC / Method

class Solution:
    def minSwapsCouples(self, row: List[int]) -> int:
        def find(x):
            if p[x] != x:
                p[x] = find(p[x])
            return p[x]

        n = len(row) >> 1
        p = list(range(n))
        for i in range(0, len(row), 2):
            a, b = row[i] >> 1, row[i + 1] >> 1
            p[find(a)] = find(b)
        return n - sum(i == find(i) for i in range(n))