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\. Medium You are given two integer arrays `nums1` and `nums2` both of the same length. The **advantage** of `nums1` with respect to `nums2` is the number of indices `i` for which `nums1[i] > nums2[i]`. Return _any permutation of_ `nums1` _that maximizes its **advantage** with respect to_ `nums2`. **Example 1:** **Input:** nums1 = [2,7,11,15], nums2 = [1,10,4,11] **Output:** [2,11,7,15] **Example 2:** **Input:** nums1 = [12,24,8,32], nums2 = [13,25,32,11] **Output:** [24,32,8,12] **Constraints:** * 1 <= nums1.length <= 105 * `nums2.length == nums1.length` * 0 <= nums1[i], nums2[i] <= 109

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)