Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given1->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.
本文共 291 字，大约阅读时间需要 1 分钟。
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given1->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.
转载于:https://www.cnblogs.com/yangscode/p/5031168.html