Skip to content

Latest commit

 

History

History
29 lines (18 loc) · 556 Bytes

README.md

File metadata and controls

29 lines (18 loc) · 556 Bytes

15.Advantage Shuffle

Description

Given two arrays A and B of equal size, the advantage of A with respect to B is the number of indices i for which A[i] > B[i].

Return any permutation of A that maximizes its advantage with respect to B.

##Example1

Input: (A = [2, 7, 11, 15]), (B = [1, 10, 4, 11])
Output: [2, 11, 7, 15]

##Example2

Input: (A = [12, 24, 8, 32]), (B = [13, 25, 32, 11])
Output: [24, 32, 8, 12]

Note

  • 1 <= A.length = B.length <= 10000

From

LeetCode