N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing any two people, then they stand up and switch seats.
The people and seats are represented by an integer from 0
to 2N-1
, the couples are numbered in order, the first couple being (0, 1)
, the second couple being (2, 3)
, and so on with the last couple being (2N-2, 2N-1)
.
The couples' initial seating is given by row[i]
being the value of the person who is initially sitting in the i-th seat.
Example 1:
Input: row = [0, 2, 1, 3] Output: 1 Explanation: We only need to swap the second (row[1]) and third (row[2]) person.
Example 2:
Input: row = [3, 2, 0, 1] Output: 0 Explanation: All couples are already seated side by side.
Note:
len(row)
is even and in the range of[4, 60]
.row
is guaranteed to be a permutation of0...len(row)-1
.
思路:遇到一个不是cp的,就把cp交换到旁边
这看起来是brute force,其实也是最greedy和最optimal的做法
无非就是不匹配的cps组成一个环(长度为N)嘛,最少需要N-1次总的交换
然后交换一下当前不匹配的cp,就把当前cp从环里面拿出来,剩下N-1长度的环,一直按照这样的方法交换下去就是optimal的
蕴含一点数学在里面的
class Solution:
def minSwapsCouples(self, row):
"""
:type row: List[int]
:rtype: int
"""
d = {}
for i, v in enumerate(row):
d[v] = i
ret = 0
for i in range(0, len(row), 2):
cp = row[i]^1
if row[i+1] == cp: continue
d[row[i+1]] = d[cp]
row[i+1], row[d[cp]] = cp, row[i+1]
ret += 1
return ret
s=Solution()
print(s.minSwapsCouples([0,2,4,6,7,1,3,5]))
print(s.minSwapsCouples([0,2,1,3]))
print(s.minSwapsCouples([3,2,0,1]))