coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/restore-the-array-from-adjacent-pairs.html
View File

@@ -7,7 +7,7 @@
<p>Return <em>the original array </em><code>nums</code><em>. If there are multiple solutions, return <strong>any of them</strong></em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> adjacentPairs = [[2,1],[3,4],[3,2]]
@@ -16,7 +16,7 @@
Notice that adjacentPairs[i] may not be in left-to-right order.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> adjacentPairs = [[4,-2],[1,4],[-3,1]]
@@ -25,7 +25,7 @@ Notice that adjacentPairs[i] may not be in left-to-right order.
Another solution is [-3,1,4,-2], which would also be accepted.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> adjacentPairs = [[100000,-100000]]