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

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
leetcode-cn/problem (Chinese)/交换和 [sum-swap-lcci].html
View File

@@ -2,16 +2,18 @@
<p>返回一个数组，第一个元素是第一个数组中要交换的元素，第二个元素是第二个数组中要交换的元素。若有多个答案，返回任意一个均可。若无满足条件的数值，返回空数组。</p>
<p><strong>示例:</strong></p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入:</strong> array1 = [4, 1, 2, 1, 1, 2], array2 = [3, 6, 3, 3]
<strong>输出:</strong> [1, 3]
<pre>
<strong>输入：</strong>array1 = [4, 1, 2, 1, 1, 2], array2 = [3, 6, 3, 3]
<strong>输出：</strong>[1, 3]
</pre>
<p><strong>示例:</strong></p>
<p><strong>示例 2：</strong></p>
<pre><strong>输入:</strong> array1 = <code>[1, 2, 3], array2 = [4, 5, 6]</code>
<strong>输出: </strong>[]</pre>
<pre>
<strong>输入：</strong>array1 = <code>[1, 2, 3], array2 = [4, 5, 6]</code>
<strong>输出：</strong>[]</pre>
<p><strong>提示：</strong></p>