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

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

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

36
leetcode-cn/problem (English)/合并排序的数组(English) [sorted-merge-lcci].html
View File

@@ -1,18 +1,18 @@
<p>You are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.</p>
<p>Initially the number of elements in A and B are&nbsp;<em>m</em>&nbsp;and&nbsp;<em>n</em> respectively.</p>
<p><strong>Example:</strong></p>
<pre>
<strong>Input:</strong>
A = [1,2,3,0,0,0], m = 3
B = [2,5,6], n = 3
<strong>Output:</strong>&nbsp;[1,2,2,3,5,6]</pre>
<p><strong>Note:</strong></p>
<ul>
<li><code>A.length == n + m</code></li>
</ul>
<p>You are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.</p>
<p>Initially the number of elements in A and B are&nbsp;<em>m</em>&nbsp;and&nbsp;<em>n</em> respectively.</p>
<p><strong>Example:</strong></p>
<pre>
<strong>Input:</strong>
A = [1,2,3,0,0,0], m = 3