765-Couples Holding Hands

Description:
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 of 0…len(row)-1.

解题思路:
贪心算法。第一次从左往右顺序遍历，用map记录值对应的下标。第二次从左往右遍历，若left为奇数，那么他的另一半为left - 1,若left为偶数，那么他的另一半为left + 1，若他不在left的右边,分别更新row和map，将left当前右边的元素与right进行替换。

解法:

class Solution {
    public int minSwapsCouples(int[] row) {
        int res = 0, len = row.length;
        int[] map = new int[len];

        for(int i = 0;i < len;i++)  map[row[i]] = i;

        for(int i = 0;i < len;i += 2){
            int left = row[i];
            int right = left % 2 == 0 ? left + 1 : left - 1;
            if(row[i + 1] != right){
                res++;
                //注意这里，因为right已经就位了，就不需要管他的map和row了。只需更新left右边元素的map和row
                map[row[i + 1]] = map[right];
                row[map[right]] = row[i + 1];
            }
        }

        return res;
    }
}