-
Notifications
You must be signed in to change notification settings - Fork 0
/
765.py
48 lines (34 loc) · 1.2 KB
/
765.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
from data_structures import UnionFind
from utils import assert_solvers
class SolutionExtraArray:
def minSwapsCouples(self, row: list[int]) -> int:
people = [0]*len(row)
for seat, person_id in enumerate(row):
people[person_id] = seat
min_swaps = 0
for i in range(0, len(row), 2):
id0, id1 = row[i], row[i+1]
if abs(id0-id1) == 1 and (id0+id1 - 1)%4 == 0:
continue
min_swaps += 1
idx = id0 + 1 if id0 % 2 == 0 else id0 - 1
row[people[idx]] = id1
people[id1] = people[idx]
return min_swaps
class SolutionUnionFind:
def minSwapsCouples(self, row: list[int]) -> int:
uf = UnionFind(len(row))
for i in range(0, len(row), 2):
uf.roots[row[i+1]] = row[i]
min_swaps = 0
for i in range(0, len(row), 2):
if uf.union(i, i+1):
min_swaps += 1
return min_swaps
if __name__ == '__main__':
solvers = [SolutionExtraArray().minSwapsCouples, SolutionUnionFind().minSwapsCouples, ]
test_inputs = [
([[0,2,1,3]], 1),
([[3,2,0,1]], 0),
]
assert_solvers(solvers, test_inputs)