Reverse Linked List II - Coddicted

Reverse Linked List II

Title: Reverse Linked List II Source: leetcode.com

Reverse a linked list from position m to n. Do it in-place and in one-pass.

For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,

return 1->4->3->2->5->NULL.

Note:
Given m, n satisfy the following condition:
1 ≤ mn ≤ length of list.

Python solution


Back To Top
Rate this post

Leave a Reply