Package g0801_0900.s0870_advantage_shuffle

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= nums1.length <= 10<sup>5</sup></code>

    • nums2.length == nums1.length

    • <code>0 <= nums1i, nums2i<= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final IntArray advantageCount(IntArray nums1, IntArray nums2)

      • Methods inherited from class java.lang.Object

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