mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
34 lines
884 B
HTML
34 lines
884 B
HTML
<p>给你一个链表，两两交换其中相邻的节点，并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题（即，只能进行节点交换）。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/03/swap_ex1.jpg" style="width: 422px; height: 222px;" />
|
||
<pre>
|
||
<strong>输入：</strong>head = [1,2,3,4]
|
||
<strong>输出：</strong>[2,1,4,3]
|
||
</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>head = []
|
||
<strong>输出：</strong>[]
|
||
</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>head = [1]
|
||
<strong>输出：</strong>[1]
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>
|
||
<li><code>0 <= Node.val <= 100</code></li>
|
||
</ul>
|