1 Star 0 Fork 0

xiangxiang/LeetCode-NOTES

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
solution.cpp 1.36 KB
一键复制 编辑 原始数据 按行查看 历史
默然 提交于 7年前 . update all algorithms.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution
{
public:
void reverseList(ListNode *&head)
{
ListNode *h = new ListNode(0);
ListNode *tmp;
while (head != NULL)
{
tmp = head->next;
head->next = h->next;
h->next = head;
head = tmp;
}
head = h->next;
}
void twistList(ListNode *&l1, ListNode *&l2)
{
ListNode *p1, *p2, *tmp;
p1 = l1; p2 = l2;
while (p1 != NULL && p2 != NULL) {
tmp = p2->next;
p2->next = p1->next;
p1->next = p2;
p1 = p1->next->next;
p2 = tmp;
}
}
void reorderList(ListNode *head)
{
if (head == NULL || head->next == NULL || head->next->next == NULL)
{
return;
}
ListNode *slow, *fast;
slow = head; fast = head;
while (fast != NULL && fast->next != NULL)
{
slow = slow->next;
if (fast->next->next == NULL)
{
break;
}
fast = fast->next->next;
}
ListNode *l2 = slow->next;
slow->next = NULL;
reverseList(l2);
twistList(head, l2);
}
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/xiangxiang920/LeetCode-NOTES.git
git@gitee.com:xiangxiang920/LeetCode-NOTES.git
xiangxiang920
LeetCode-NOTES
LeetCode-NOTES
master

搜索帮助