Day 15
Date: October 10, 2022 2:40 PM
LinkedIn: https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/
Title: 使序列递增的最小交换次数
本题是动态规划DP
class Solution:
def minSwap(self, nums1: List[int], nums2: List[int]) -> int:
n = len(nums1)
dp = [[0 for j in range(2)] for i in range(n)] # 创建二维列表dp[n][2]并初始化 n代表第n哥数,2代表两个状态0为不交换1为交换
dp[0][0],dp[0][1] = 0, 1 #第一个数交换为1,不交换为0
for i in range(1, n):
a1, a2, b1, b2 = nums1[i-1], nums1[i], nums2[i-1], nums2[i]
if (a1<a2 and b1<b2) and (a1<b2 and b1<a2) :#两个序列都递增,且任意对交换对应位置后依然满足
dp[i][0] = min(dp[i-1][0], dp[i-1][1]) #i不交换
dp[i][1] = dp[i][0] + 1 #i交换
elif a1<a2 and b1<b2 :#两个序列都递增,但若交换必两个都换,不交换就都不交换
dp[i][0] = dp[i-1][0] #i,i-1都不交换
dp[i][1] = dp[i-1][1] + 1 #i,i-1都交换
else: #两个序列存在不递增
dp[i][0] = dp[i-1][1] #i不交换,i-1要交换
dp[i][1] = dp[i-1][0] + 1 #i交换,i-1不交换
return min(dp[n-1][0], dp[n-1][1]) #返回最小次数