advantage-shuffle

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two integer arrays <code>nums1</code> and <code>nums2</code> both of the same length. The advantage of <code>nums1</code> with respect to <code>nums2</code> is the number of indices <code>i</code> for which <code>nums1[i] &gt; nums2[i]</code>.

Return any permutation of <code>nums1</code> that maximizes its advantage with respect to <code>nums2</code>.

&nbsp;
Example 1:
<pre>Input: nums1 = [2,7,11,15], nums2 = [1,10,4,11]
Output: [2,11,7,15]
</pre>Example 2:
<pre>Input: nums1 = [12,24,8,32], nums2 = [13,25,32,11]
Output: [24,32,8,12]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums1.length &lt;= 105</code></li>
	<li><code>nums2.length == nums1.length</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 109</code></li>
</ul>

advantageCount

Advantage Shuffle

Greedy

Array

Two Pointers

Sorting

给定两个长度相等的数组&nbsp;<code>nums1</code>&nbsp;和&nbsp;<code>nums2</code>，<code>nums1</code>&nbsp;相对于 <code>nums2</code> 的优势可以用满足&nbsp;<code>nums1[i] &gt; nums2[i]</code>&nbsp;的索引 <code>i</code>&nbsp;的数目来描述。

返回 <code>nums1</code> 的&nbsp;任意&nbsp;排列，使其相对于 <code>nums2</code>&nbsp;的优势最大化。

&nbsp;

示例 1：

<pre>
输入：nums1 = [2,7,11,15], nums2 = [1,10,4,11]
输出：[2,11,7,15]
</pre>

示例 2：

<pre>
输入：nums1 = [12,24,8,32], nums2 = [13,25,32,11]
输出：[24,32,8,12]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums1.length &lt;= 105</code></li>
	<li><code>nums2.length == nums1.length</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 109</code></li>
</ul>