题目描述:
反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。
说明:
1 ≤ m ≤ n ≤ 链表长度。
示例:
输入: 1->2->3->4->5->NULL, m = 2, n = 4
输出: 1->4->3->2->5->NULL
AC C++ Solution:
/**
* 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;
n = n - m;
ListNode prehead(0);
prehead.next = head;
ListNode* pre = &prehead;
while(--m)
pre = pre->next;
ListNode* pstart = pre->next;
while(n--) {
ListNode *p = pstart->next;
pstart->next = p->next;
p->next = pre->next;
pre->next = p; //每次把p节点交换到反转区间首位
}
return prehead.next;
}
};