leetcode Weekly Contest 67 -- 765. Couples Holding Hands
2018-01-14 12:22
495 查看
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. Aswap consists of choosing
any two people, then they stand up and switch seats.
The people and seats are represented by an integer from
The couples' initial seating is given by
Example 1:
Example 2:
Note:
any two people, then they stand up and switch seats.
The people and seats are represented by an integer from
0to
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].
rowis guaranteed to be a permutation of
0...len(row)-1.
class Solution { public: int minSwapsCouples(vector<int>& row) { int a,sum=0; for (int i = 0; i < row.size(); i += 2) { if (row[i] % 2 == 0)a = row[i] + 1; else a = row[i] - 1; for (int j = i + 1; j < row.size(); j++) { if (a == row[j]&& j != i + 1) { swap(row[i + 1], row[j]); sum++; break; } } } return sum; } };
相关文章推荐
- leetcode Weekly Contest 67 -- 763. Partition Labels
- LeetCode Weekly Contest 42解题思路
- LeetCode Weekly Contest 74 793. Preimage Size of Factorial Zeroes Function【二分】
- LeetCode Weekly Contest 35解题思路
- LeetCode Weekly Contest 38解题思路
- LeetCode Weekly Contest 30解题思路
- LeetCode Weekly Contest 24 之 538.Convert BST to Greater Tree
- LeetCode Weekly Contest 24 之 542.01 Matrix
- LeetCode Weekly Contest 13-HammingDistance【易】
- LeetCode Weekly Contest 43【总结】
- LeetCode Weekly Contest 32
- LeetCode Weekly Contest 64 - 752. Open the Lock【BFS + string】
- LeetCode Weekly Contest 26解题思路
- LeetCode Weekly Contest 34解题思路
- LeetCode Weekly Contest 27
- LeetCode Weekly Contest 13-TotalHamming Distance【中】
- LeetCode Weekly Contest 43解题思路
- LeetCode Weekly Contest 45解题思路
- leetcode weekly contest 61 ( 740. Delete and Earn )
- LeetCode Weekly Contest 24 之 543. Diameter of Binary Tree