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].

思路：DP，dp[i][0]表示到当前i位置OK，并且第i位不需要交换需要的次数，dp[i][1]表示第i位需要交换需要的次数

因为只能i位置和i位置的交换，所以自然就有限定的子数组划分

class Solution:
    def minSwap(self, A, B):
        """
        :type A: List[int]
        :type B: List[int]
        :rtype: int
        """
        dp = [[999999,999999] for _ in range(len(A))]
        dp[0][0]=0
        dp[0][1]=1
        for i in range(1, len(A)):
            if dp[i-1][0]!=999999 and A[i]>A[i-1] and B[i]>B[i-1]:
                dp[i][0] = min(dp[i-1][0], dp[i][0])
            if dp[i-1][1]!=999999 and A[i]>B[i-1] and B[i]>A[i-1]:
                dp[i][0] = min(dp[i-1][1], dp[i][0])
                
            if dp[i-1][0]!=999999 and A[i]>B[i-1] and B[i]>A[i-1]:
                dp[i][1] = min(dp[i-1][0]+1, dp[i][1])
            if dp[i-1][1]!=999999 and A[i]>A[i-1] and B[i]>B[i-1]:
                dp[i][1] = min(dp[i-1][1]+1, dp[i][1])
                
        return min(dp[-1])
    
s=Solution()
#print(s.minSwap(A = [1,3,5,4], B = [1,2,3,7]))
print(s.minSwap(A = [1,100,200,300,6], B = [1,2,3,4,600]))

干脆直接去掉判断能不能到达，反正题目说最后一定可以

class Solution:
    def minSwap(self, A, B):
        """
        :type A: List[int]
        :type B: List[int]
        :rtype: int
        """
        dp = [[999999,999999] for _ in range(len(A))]
        dp[0][0]=0
        dp[0][1]=1
        for i in range(1, len(A)):
            if A[i]>A[i-1] and B[i]>B[i-1]:
                dp[i][0] = min(dp[i-1][0], dp[i][0])
            if A[i]>B[i-1] and B[i]>A[i-1]:
                dp[i][0] = min(dp[i-1][1], dp[i][0])
                
            if A[i]>B[i-1] and B[i]>A[i-1]:
                dp[i][1] = min(dp[i-1][0]+1, dp[i][1])
            if A[i]>A[i-1] and B[i]>B[i-1]:
                dp[i][1] = min(dp[i-1][1]+1, dp[i][1])
                
        return min(dp[-1])
    
s=Solution()
#print(s.minSwap(A = [1,3,5,4], B = [1,2,3,7]))
print(s.minSwap(A = [1,100,200,300,6], B = [1,2,3,600]))