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 ≤ m ≤ n ≤ length of list.
Original: https://blog.51cto.com/u_15740726/5541667
Author: wx62ea2466cca9a
Title: 92. Reverse Linked List II
原创文章受到原创版权保护。转载请注明出处:https://www.johngo689.com/508393/
转载文章受原作者版权保护。转载请注明原作者出处!