leetcode-765

发表于 | 分类于 | 阅读次数:
字数统计: 56 | 阅读时长 ≈ 1 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

class Solution(object):
    def minSwapsCouples(self, row):
        """
        :type row: List[int]
        :rtype: int
        """
        res = 0
        for i in xrange(0, len(row), 2):
            p = row[i] ^ 1 
            j = row.index(p)
            if (j-i) > 1:
                row[i+1], row[j] = row[j], row[i+1]
                res += 1
        return res