Class Solution
java.lang.Object
g1801_1900.s1855_maximum_distance_between_a_pair_of_values.Solution
1855 - Maximum Distance Between a Pair of Values.<p>Medium</p>
<p>You are given two <strong>non-increasing 0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>.</p>
<p>A pair of indices <code>(i, j)</code>, where <code>0 <= i < nums1.length</code> and <code>0 <= j < nums2.length</code>, is <strong>valid</strong> if both <code>i <= j</code> and <code>nums1[i] <= nums2[j]</code>. The <strong>distance</strong> of the pair is <code>j - i</code>.</p>
<p>Return <em>the <strong>maximum distance</strong> of any <strong>valid</strong> pair</em> <code>(i, j)</code><em>. If there are no valid pairs, return</em> <code>0</code>.</p>
<p>An array <code>arr</code> is <strong>non-increasing</strong> if <code>arr[i-1] >= arr[i]</code> for every <code>1 <= i < arr.length</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums1 = [55,30,5,4,2], nums2 = [100,20,10,10,5]</p>
<p><strong>Output:</strong> 2</p>
<p><strong>Explanation:</strong> The valid pairs are (0,0), (2,2), (2,3), (2,4), (3,3), (3,4), and (4,4). The maximum distance is 2 with pair (2,4).</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums1 = [2,2,2], nums2 = [10,10,1]</p>
<p><strong>Output:</strong> 1</p>
<p><strong>Explanation:</strong> The valid pairs are (0,0), (0,1), and (1,1). The maximum distance is 1 with pair (0,1).</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> nums1 = [30,29,19,5], nums2 = [25,25,25,25,25]</p>
<p><strong>Output:</strong> 2</p>
<p><strong>Explanation:</strong> The valid pairs are (2,2), (2,3), (2,4), (3,3), and (3,4). The maximum distance is 2 with pair (2,4).</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums1.length, nums2.length <= 10<sup>5</sup></code></li>
<li><code>1 <= nums1[i], nums2[j] <= 10<sup>5</sup></code></li>
<li>Both <code>nums1</code> and <code>nums2</code> are <strong>non-increasing</strong>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
maxDistance
public int maxDistance(int[] n1, int[] n2)
-