mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
29 lines
1.0 KiB
HTML
29 lines
1.0 KiB
HTML
<p>Given the <code>head</code> of a singly linked list and two integers <code>left</code> and <code>right</code> where <code>left <= right</code>, reverse the nodes of the list from position <code>left</code> to position <code>right</code>, and return <em>the reversed list</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev2ex2.jpg" style="width: 542px; height: 222px;" />
|
|
<pre>
|
|
<strong>Input:</strong> head = [1,2,3,4,5], left = 2, right = 4
|
|
<strong>Output:</strong> [1,4,3,2,5]
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> head = [5], left = 1, right = 1
|
|
<strong>Output:</strong> [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 <= n <= 500</code></li>
|
|
<li><code>-500 <= Node.val <= 500</code></li>
|
|
<li><code>1 <= left <= right <= n</code></li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<strong>Follow up:</strong> Could you do it in one pass? |