题目:
Reverse a linked list from position m to n. Do it in one-pass.
Note: 1 ≤ m ≤ n ≤ length of list.
Example:
Input: 1->2->3->4->5->NULL, m = 2, n = 4 Output: 1->4->3->2->5->NULL
代码:
/**
* 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) {
ListNode* first = new ListNode(0);
first->next = head;
ListNode *p = first;
for (int i = 1; i < m; i++) {
p = p->next;
}
ListNode* second = p->next, *q = p->next;
if (!p->next)return first->next;
else {
ListNode* third = second->next;
for (int i = m; i < n; i++) {
second->next = third->next;
third->next = q;
p->next = third;
q = p->next;
third = second->next;
if (third == NULL)break;
}
}
return first->next;
}
};