765. Couples Holding Hands

题目

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:

1. len(row) is even and in the range of [4, 60].
2. row is guaranteed to be a permutation of 0...len(row)-1.

思路

本题思路很简单明了，首先我们先来看看这是个什么问题，很明显这是个动态连通性（union-find）问题。一共N对夫妇，需要保证每两个夫妇坐在一座两人沙发上。我们发现一对夫妇必然满足（0，1）或（1，0）的形式。那么接下来我们的方案只要遍历数组两遍，时间复杂度为O(n)。
思路很简单，大家直接看代码就能理解

代码

class Solution {
public:
    int minSwapsCouples(vector<int>& row) {
        unordered_map<int,int> mp;
        int index,count=0;
        for(int i=0;i<row.size();i++)
        {
            mp[row[i]] = i;
        }
        for(int i=0;i<row.size()-1;i+=2)
        {
            if (row[i]<row[i+1]){
                if(row[i]%2==0)
                {
                    if(row[i+1]-row[i]==1)
                        continue;
                    else{
                        index = mp[row[i]+1];
                        swap(row,mp,i+1,index);
                        count++;
                    }
                }
                else
                {
                    index = mp[row[i]-1];
                    swap(row,mp,i+1,index);
                    count++;
                }
            }
            else {
                if(row[i]%2==1)
                {
                    if(row[i]-row[i+1]==1)
                        continue;
                    else{
                        index = mp[row[i]-1];
                        swap(row,mp,i+1,index);
                        count++;
                    }
                }
                else
                {
                    index = mp[row[i]+1];
                    swap(row,mp,i+1,index);
                    count++;
                }
            }
        }
        return count;
        
        
    }
private:
    void swap(vector<int>& row,unordered_map<int,int>& mp,int i,int j){
        mp[row[i]] = j;
        mp[row[j]] = i;
        int tmp = row[i];
        row[i] = row[j];
        row[j] = tmp;
        return;
    }
};