801. Minimum Swaps To Make Sequences Increasing
We have two integer sequences A and B of the same non-zero length.
We are allowed to swap elements A[i] and B[i]. Note that both elements are in the same index position in their respective sequences.
At the end of some number of swaps, A and B are both strictly increasing. (A sequence is strictly increasing if and only if A[0] < A[1] < A[2] < … < A[A.length - 1].)
Given A and B, return the minimum number of swaps to make both sequences strictly increasing. It is guaranteed that the given input always makes it possible.
Example:
Input: A = [1,3,5,4], B = [1,2,3,7]
Output: 1
Explanation:
Swap A[3] and B[3]. Then the sequences are:
A = [1, 3, 5, 7] and B = [1, 2, 3, 4]
which are both strictly increasing.
Note:
- A, B are arrays with the same length, and that length will be in the range [1, 1000].
- A[i], B[i] are integer values in the range [0, 2000].
Approach
- 题目大意是给你两个数组,交换次数最少,然后使得这两个数组递增,很明显是要用动态规划,然后这道题比较难理解,因为需要特殊处理过的数据,自己可以编写测试数据,看输出来理解代码,博主并没有完全理解,只好对代码做简要的注释,不过题目很有趣,记下来以防忘记。
Code
class Solution {
public:
int minSwap(vector<int>& A, vector<int>& B) {
int n = A.size();
vector<int>maxn(n, INT_MAX);
vector<int>minn(n, INT_MAX);
maxn[0] = 1;
minn[0] = 0;
for (int i = 1; i < n; i++) {
if (A[i] > A[i - 1] && B[i] > B[i - 1]) {
minn[i] = minn[i - 1];//一直不换
maxn[i] = maxn[i - 1] + 1;//一直交换
}
if (A[i] > B[i - 1] && B[i] > A[i - 1]) {
minn[i] = min(minn[i], maxn[i - 1]);//要么继续不用交换,要么交换前面可以交换上
maxn[i] = min(maxn[i], minn[i - 1] + 1);//缩小交换的范围
}
}
return min(maxn[n - 1], minn[n - 1]);
}
};