原题如下:
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.
class Solution {
public:
ListNode *reverseBetween(ListNode *head, int m, int n) {
if(m == n || head == NULL)
return head;
ListNode *p,*q,*flag,*flag2,*rear;
if(m == 1){ //m等于1从头开始逆转
flag = head;
q = head->next;
flag->next = NULL;
for(int i = 0; i < n - m; i++) {
p = q->next;
q->next = head;
head = q;
q = p;
}
flag->next = q;
return head;
}
flag = head;
for(int i = 2; i < m; i++)//使flag指向开始逆转的前一个节点
flag = flag->next;
flag2 = flag->next; //第一个节点不用逆转
rear = flag2;//rear指向第一个逆转的节点
p = flag2->next;
q = p;//使p指向待逆转的节点
flag2->next = NULL;
for(int i = 0; i < n - m ; i++){ //在flag与flag2之间插入节点,插入后flag2前移一位,指向刚刚插入的节点
q = p->next;
flag->next = p;
p->next = flag2;
flag2 = p;
p = q;
}
rear->next = q;
return head;
}
};
节点的逆转涉及节点的删除和插入操作,实现并不难,关键是要多留意细节。
补:
今天(14.06.05)重温这篇算法题,看到当时的思路太麻烦,重新搜索后发现了更好的思路:即m之前的节点保持不变,针对m到n之间的节点(准确说是从第m + 1个节点开始到第n个节点),采用先摘除再插入的算法,即首先将节点从链表中摘除,但要保持链表的连接状态,这样的好处是不必对n之后的节点进行单独处理,然后采用头插法将节点插入待插入位置,其实头插法和尾插法都只需在链表中标记一个节点,切勿搞得太复杂。
ListNode *reverseBetween(ListNode *head, int m, int n) {
if(head == NULL ||head->next == NULL || m >= n)
return head;
ListNode *tHead = new ListNode(0);
tHead->next = head;
ListNode *pre = tHead;
for(int i = 1; i < m; i++){ //使pre指向第m-1个节点
pre = pre->next;
}
ListNode *p = pre->next; //p指向第m个节点
for(;m < n; m++){
ListNode *temp = p->next ;
p->next = temp->next;
temp->next = pre->next;
pre->next = temp;
}
head = tHead->next;
delete tHead;
return head;
}