https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing/
+
 https://leetcode.cn/problems/6eUYwP/
 
 https://leetcode.cn/problems/three-in-one-lcci/

minimum-swaps-to-make-sequences-increasing/index.ts

@@ -0,0 +1,19 @@
+export default function minSwap(nums1: number[], nums2: number[]): number {
+    const n = nums1.length;
+    let a = 0,
+        b = 1;
+    for (let i = 1; i < n; i++) {
+        const at = a,
+            bt = b;
+        a = b = n;
+        if (nums1[i] > nums1[i - 1] && nums2[i] > nums2[i - 1]) {
+            a = Math.min(a, at);
+            b = Math.min(b, bt + 1);
+        }
+        if (nums1[i] > nums2[i - 1] && nums2[i] > nums1[i - 1]) {
+            a = Math.min(a, bt);
+            b = Math.min(b, at + 1);
+        }
+    }
+    return Math.min(a, b);
+}