3. [code] 反转链表Ⅱ
3.1. 题目
反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。
说明:
1 ≤ m ≤ n ≤ 链表长度。
示例:
输入: 1->2->3->4->5->NULL, m = 2, n = 4
输出: 1->4->3->2->5->NULL
难度:中等
3.2. 思路
需要注意4个关键的节点:逆序段头节点B及其前驱节点A,逆序段尾节点C及其后继D
3.3. 代码
/**
* 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) {
int change_len = n-m+1;
ListNode* pre_head = NULL; //关键节点A:逆序段头节点的前驱节点
ListNode* result = head; //输出的结果链表的头
//while循环把指针head移到需要逆序段的头
for (int i = 0; i < m-1; ++i){
pre_head = head; //关键节点A:逆序段头节点的前驱
head = head->next;
}
ListNode* changed_list_tail = head; //关键节点B:逆序段的头节点,将来作为逆序段的尾
//将需要逆序段进行逆序
ListNode* new_head = NULL;
for (int i = m; i < n; ++i){
ListNode* next = head->next;
head->next = new_head;
new_head = head;
}
//关键节点B指向是逆序段尾的后继D
changed_list_tail->next = head;
if (pre_head){
pre_head->next = new_head; //关键节点A指向C
}
else{
result = new_head;
}
return result;
}
};
也不知道为啥,提交了超时了。
class Solution {
public:
ListNode *reverseBetween(ListNode *head, int m, int n) {
// 1<=m<=n<=len
ListNode dummy(-1);
dummy.next = head;
ListNode *prev = &dummy;
for (int i = 0; i < m-1; ++i)
prev = prev->next;
ListNode* const head2 = prev;
prev = head2->next;
ListNode *cur = prev->next;
for (int i = m; i < n; ++i) {
prev->next = cur->next;
cur->next = head2->next;
head2->next = cur;
cur = prev->next;
}
return dummy.next;
}
};