1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 03:56:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

This commit is contained in:
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions

View File

@@ -1,18 +1,20 @@
<p>给定两个大小相等的数组&nbsp;<code>A</code>&nbsp;&nbsp;<code>B</code>A 相对于 B <em>优势</em>可以用满足&nbsp;<code>A[i] &gt; B[i]</code>&nbsp;的索引 <code>i</code>&nbsp;的数目来描述。</p>
<p>给定两个大小相等的数组&nbsp;<code>nums1</code>&nbsp;&nbsp;<code>nums2</code><code>nums1</code>&nbsp;相对于 <code>nums</code>&nbsp;<em>优势</em>可以用满足&nbsp;<code>nums1[i] &gt; nums2[i]</code>&nbsp;的索引 <code>i</code>&nbsp;的数目来描述。</p>
<p>返回&nbsp;<code>A</code>&nbsp;<strong>任意</strong>排列,使其相对于 <code>B</code>&nbsp;的优势最大化。</p>
<p>返回 <font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace" size="1"><span style="background-color: rgb(249, 242, 244);">nums1</span></font>&nbsp;<strong>任意</strong>排列,使其相对于 <code>nums2</code>&nbsp;的优势最大化。</p>
<p>&nbsp;</p>
<p><strong>示例 1</strong></p>
<pre><strong>输入:</strong>A = [2,7,11,15], B = [1,10,4,11]
<pre>
<strong>输入:</strong>nums1 = [2,7,11,15], nums2 = [1,10,4,11]
<strong>输出:</strong>[2,11,7,15]
</pre>
<p><strong>示例 2</strong></p>
<pre><strong>输入:</strong>A = [12,24,8,32], B = [13,25,32,11]
<pre>
<strong>输入:</strong>nums1 = [12,24,8,32], nums2 = [13,25,32,11]
<strong>输出:</strong>[24,32,8,12]
</pre>
@@ -20,8 +22,8 @@
<p><strong>提示:</strong></p>
<ol>
<li><code>1 &lt;= A.length = B.length &lt;= 10000</code></li>
<li><code>0 &lt;= A[i] &lt;= 10^9</code></li>
<li><code>0 &lt;= B[i] &lt;= 10^9</code></li>
</ol>
<ul>
<li><code>1 &lt;= nums1.length &lt;= 10<sup>5</sup></code></li>
<li><code>nums2.length == nums1.length</code></li>
<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 10<sup>9</sup></code></li>
</ul>