-
指针的巧妙使用,和虚节点在链表中的使用。
比较容易想到的算法(先找到需要翻转的链表段,保存该段的头一个节点和后一个节点,链表段翻转后再和两个节点拼接)
LinkNode* reverse(LinkNode *head, LinkNode *end)
{
LinkNode *front = nullptr;
LinkNode *cur = head;
LinkNode curnext = head;
while (cur != end)
{
curnext = cur->next;
cur->next = front;
front = cur;
cur = curnext;
}
cur->next = front;
front = cur;
return front;
}
LinkNode ReverseLinkedListIIMy(LinkNode *head, int m, int n)
{
LinkNode *Thead = head;
LinkNode *start = head;
LinkNode *end = head;
LinkNode *dummy = new LinkNode(-1), *cur = dummy;
dummy->next = head;
LinkNode *pre = dummy;
end = dummy->next;
start = dummy->next;
for (int i = 0; i < m - 1; i++)
{
pre = start;
start = start->next;
}
for (int i = 0; i < n - 1; i++)
{
end = end->next;
}
LinkNode *endnext = end->next;
LinkNode head1 = reverse(start, end);
pre->next = head1;
while (head1->next)
{
head1 = head1->next;
}
head1->next = endnext;
return dummy->next;
}
比较好的算法:
给定一个链表,我们需要翻转链表m-n的节点。比如1-2-3-4-5-7-8-9.翻转(1-4)就变为4-3-2-1-5-7-8-9.我们保存需要翻转链表段的头一个节点(pre),cur(当前的节点,需要翻转的第一个节点,位置如1),t(即cur-next,需要放到pre后面的节点,t->next=pre->next,pre-next=t),如上图所示。代码如下所示:
LinkNode ReverseLinkedListII(LinkNode *head, int m, int n)
{
LinkNode *dummy = new LinkNode(-1), *pre = dummy;
dummy->next = head;
for (int i = 0; i < m-1; i++)
{
pre = pre->next;
}
LinkNode *cur = pre->next;
for (int i = m; i < n; i++)
{
LinkNode *t = cur->next;
cur->next = t->next;
t->next = pre->next;
pre->next = t;
}return dummy->next;
}
在处理链表问题的时候,我们虚节点在链表中的使用。如上面算法的dummy节点,这样可以避免在头结点发生变化的时候需要单独处理,逻辑有可能比较复杂。而且使代码可读性较好。
[LeetCode] Reverse Linked List II 倒置链表之二(算法分析)
最新推荐文章于 2021-07-20 00:02:04 发布