mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
28 lines
1.0 KiB
HTML
28 lines
1.0 KiB
HTML
<p>You are given the <code>head</code> of a linked list, and an integer <code>k</code>.</p>
|
|
|
|
<p>Return <em>the head of the linked list after <strong>swapping</strong> the values of the </em><code>k<sup>th</sup></code> <em>node from the beginning and the </em><code>k<sup>th</sup></code> <em>node from the end (the list is <strong>1-indexed</strong>).</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/21/linked1.jpg" style="width: 400px; height: 112px;" />
|
|
<pre>
|
|
<strong>Input:</strong> head = [1,2,3,4,5], k = 2
|
|
<strong>Output:</strong> [1,4,3,2,5]
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> head = [7,9,6,6,7,8,3,0,9,5], k = 5
|
|
<strong>Output:</strong> [7,9,6,6,8,7,3,0,9,5]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the list is <code>n</code>.</li>
|
|
<li><code>1 <= k <= n <= 10<sup>5</sup></code></li>
|
|
<li><code>0 <= Node.val <= 100</code></li>
|
|
</ul>
|