题目:
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.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *reverseBetween(ListNode *head, int m, int n) {
if (m == n)
return head;
ListNode *dummy = new ListNode(-1);
dummy->next = head;
ListNode *pre = dummy;
int i = 1;
while (i < m) {
pre = head;
head = head->next;
i++;
}
ListNode *p = head;
ListNode *q = head->next;
ListNode *r;
while (i < n) {
r = q->next;
q->next = p;
p = q;
q = r;
i++;
}
head->next = q;
pre->next = p;
head = dummy->next;
delete dummy;
return head;
}
};