mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
38 lines
1.5 KiB
HTML
38 lines
1.5 KiB
HTML
<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,<u>8</u>]</code>, and <code>nums2 = [5,6,7,<u>4</u>]</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> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [1,3,5,4], nums2 = [1,2,3,7]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong>
|
|
Swap nums1[3] and nums2[3]. Then the sequences are:
|
|
nums1 = [1, 3, 5, 7] and nums2 = [1, 2, 3, 4]
|
|
which are both strictly increasing.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [0,3,5,8,9], nums2 = [2,1,4,6,9]
|
|
<strong>Output:</strong> 1
|
|
</pre>
|
|
|
|
<p> </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>
|