[leetcode] 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

代码：

#include<algorithm>
#include<vector>
class Solution {
public:
    int minSwapsCouples(vector<int>& row) {
        int cnt = 0;
        for(vector<int>::iterator it = row.begin(); it != row.end(); it+=2){
            int num = (*it) % 2 == 0? (*it) + 1 : (*it) - 1;
            vector<int>::iterator temp = find(it+1, row.end(), num);
            if(temp != it+1){
                swap(*(it+1), *(temp));
                cnt++;
            }
            
        }
        return cnt;
    }
};

class Solution {
public:
    int minSwapsCouples(vector<int>& row) {
        int n = row.size();
        int count = 0;
        vector<int> pos(n);
        for(int i = 0; i < n; ++i)
            pos[row[i]] = i;
        for(int i = 0; i < n; i += 2)
        {
            int couple = row[i] % 2 == 0 ? row[i] + 1 : row[i] - 1;
            if(pos[couple] != i + 1)
            {
                Swap(row, pos, i + 1, pos[couple]);
                ++count;
            }
        }
        return count;
    }
    
    void Swap(vector<int> & row, vector<int> & pos, int pos1, int pos2)
    {
        swap(row[pos1], row[pos2]);
        swap(pos[row[pos1]], pos[row[pos2]]);
    }
};