leetcode 092 —— Reverse Linked List II

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.

思路：与普通的链表翻转相比，多了一个前驱

class Solution {
public:
	ListNode* reverseBetween(ListNode* head, int m, int n) {
		if (m == n || !head || !head->next) return head;
		ListNode *pre = new ListNode(0);
		ListNode *p = pre;
		p->next = head;
		ListNode *start = head, *end = head;
		while (--m){
			start = start->next;
			p = p->next;
		}
		while (--n)
			end = end->next;
		ListNode *cur = start;
		ListNode *next = start->next;
		start = end->next;
		while (next != end->next){
			cur->next = start;
			start = cur;
			cur = next;
			next = next->next;
		}
		cur->next = start;
		p->next = cur;
		return pre->next;
	}
};