思路:
又是花式链表操作. 这次是颠倒指定两个索引之间的所有节点, 一次pass. 思路依然是创建一个新的头结点, 然后先找到m节点的前节点, 并记录好, 再把m节点找到并记录好, 这两个都后面要用. 然后很简单的逆转m到n之间的节点. 最后把之前的前节点的next设置为n节点, m节点的next设置成n节点的next即可. 说的有些拗口, 直接看代码会清楚些.
ListNode* reverseBetween(ListNode* head, int m, int n) {
if (! head || ! head->next || m == n)
return head;
ListNode dummy(0);
dummy.next = head;
ListNode* pre = &dummy;
for (int i = 0; i < m - 1; i++)
pre = pre->next;
ListNode* cur = pre->next, *nxt;
ListNode* recordPre = pre, *recordCur = cur;
for (int i = m; i <= n; i++) {
nxt = cur->next;
cur->next = pre;
pre = cur;
cur = nxt;
}
recordPre->next = pre;
recordCur->next = nxt;
return dummy.next;
}