Package g0801_0900.s0801_minimum_swaps_to_make_sequences_increasing

Class Solution

java.lang.Object
g0801_0900.s0801_minimum_swaps_to_make_sequences_increasing.Solution
public class Solution extends Object
801 - Minimum Swaps To Make Sequences Increasing.<p>Hard</p> <p>You are given two integer arrays of the same length <code>nums1</code> and <code>nums2</code>. In one operation, you are allowed to swap <code>nums1[i]</code> with <code>nums2[i]</code>.</p> <ul> <li>For example, if <code>nums1 = [1,2,3,8]</code>, and <code>nums2 = [5,6,7,4]</code>, you can swap the element at <code>i = 3</code> to obtain <code>nums1 = [1,2,3,4]</code> and <code>nums2 = [5,6,7,8]</code>.</li> </ul> <p>Return <em>the minimum number of needed operations to make</em> <code>nums1</code> <em>and</em> <code>nums2</code> <em><strong>strictly increasing</strong></em>. The test cases are generated so that the given input always makes it possible.</p> <p>An array <code>arr</code> is <strong>strictly increasing</strong> if and only if <code>arr[0] < arr[1] < arr[2] < ... < arr[arr.length - 1]</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums1 = [1,3,5,4], nums2 = [1,2,3,7]</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong> Swap nums1[3] and nums2[3]. Then the sequences are:</p> <p>nums1 = [1, 3, 5, 7] and nums2 = [1, 2, 3, 4]</p> <p>which are both strictly increasing.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums1 = [0,3,5,8,9], nums2 = [2,1,4,6,9]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= nums1.length <= 10<sup>5</sup></code></li> <li><code>nums2.length == nums1.length</code></li> <li><code>0 <= nums1[i], nums2[i] <= 2 * 10<sup>5</sup></code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • minSwap

      public int minSwap(int[] listA, int[] listB)