请将链表中第 nn 个节点和第 mm 个节点之间的部分翻转。
链表最多只能遍历一遍。
注意:1≤m≤n≤1≤m≤n≤ 链表长度。
样例
输入:1->2->3->4->5->NULL, m = 2, n = 4
输出: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) {
if (m == n) return head;
ListNode *dummy = new ListNode(0);
dummy->next = head;
ListNode *p = dummy;
for (int i = 0; i < m - 1; i ++ )
p = p->next;
ListNode *a = p, *b = a->next, *c = b->next;
for (int i = m + 1; i <= n; i ++ )
{
ListNode *d = c->next;
c->next = b;
b = c;
c = d;
}
a->next->next = c;
a->next = b;
return dummy->next;
}
};