Package g0001_0100.s0092_reverse_linked_list_ii

Class Solution

java.lang.Object

g0001_0100.s0092_reverse_linked_list_ii.Solution

public class Solution
extends Object

92 - Reverse Linked List II.<p>Medium</p> <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><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/02/19/rev2ex2.jpg" alt="" /></p> <p><strong>Input:</strong> head = [1,2,3,4,5], left = 2, right = 4</p> <p><strong>Output:</strong> [1,4,3,2,5]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> head = [5], left = 1, right = 1</p> <p><strong>Output:</strong> [5]</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><strong>Follow up:</strong> Could you do it in one pass?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
ListNode	reverse(ListNode head)
ListNode	reverseBetween(ListNode head, int left, int right)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

reverseBetween

public ListNode reverseBetween(ListNode head,
 int left,
 int right)

reverse

public ListNode reverse(ListNode head)