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.
此题不是讲整个链表旋转过来,而是在中间截取一段进行旋转,让一个指针指向带旋转的第一个结点的前一个结点,一个一个往后旋转即可,只是需要的指针较多,容易犯错;
代码如下: