Package g0801_0900.s0870_advantage_shuffle

Class Solution

java.lang.Object

g0801_0900.s0870_advantage_shuffle.Solution

public class Solution
extends Object

870 - Advantage Shuffle.<p>Medium</p> <p>You are given two integer arrays <code>nums1</code> and <code>nums2</code> both of the same length. The <strong>advantage</strong> of <code>nums1</code> with respect to <code>nums2</code> is the number of indices <code>i</code> for which <code>nums1[i] > nums2[i]</code>.</p> <p>Return <em>any permutation of</em> <code>nums1</code> <em>that maximizes its <strong>advantage</strong> with respect to</em> <code>nums2</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums1 = [2,7,11,15], nums2 = [1,10,4,11]</p> <p><strong>Output:</strong> [2,11,7,15]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums1 = [12,24,8,32], nums2 = [13,25,32,11]</p> <p><strong>Output:</strong> [24,32,8,12]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums1.length <= 10⁵</code></li> <li><code>nums2.length == nums1.length</code></li> <li><code>0 <= nums1[i], nums2[i] <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	advantageCount(int[] nums1, int[] nums2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

advantageCount

public int[] advantageCount(int[] nums1,
 int[] nums2)