Minimum Swaps To Make Sequences Increasing
You are given two integer arrays of the same length nums1 and nums2. In one operation, you are allowed to swap nums1[i] with nums2[i].
Return the minimum number of needed operations to make nums1 and nums2 strictly increasing. The test cases are generated so that the given input always makes it possible.
An array arr is strictly increasing if and only if arr[0] < arr[1] < arr[2] < ... < arr[arr.length - 1].
Example 1
Input
nums1 = [1,3,5,4], nums2 = [1,2,3,7]Output
1Swapping
nums1[3] and nums2[3] makes the sequences [1, 3, 5, 7] and [1, 2, 3, 4], which are both strictly increasing.Example 2
Input
nums1 = [0,3,5,8,9], nums2 = [2,1,4,6,9]Output
1One swap is sufficient to make both sequences strictly increasing.
Constraints
- 2 <= nums1.length <= 10^5
- nums2.length == nums1.length
- 0 <= nums1[i], nums2[i] <= 2 * 10^5