LeetCode 143. Reorder List
来源:互联网 发布:护资考试做题软件 编辑:程序博客网 时间:2024/06/03 20:29
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes’ values.
For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.
重排链表,设链表长为n+1,要求第n-m个结点(n,m = 0,1,2,……n)插入到第m个结点后。
其实就是沿着链表中点对称插入重排,而链表的特殊之处就在于不能走回头路,但我们可以把链表后半部分进行逆序,然后把前后两部分的链表合并就ok了。过程:
1-2-3-4-5-6-7-8↓1-2-3-45-6-7-8↓1-2-3-48-7-6-5↓1-8-2-7-3-6-4-5
class Solution {public: void reorderList(ListNode* head) { if (!head || !head->next) return; //找中点 ListNode *slow = head, *fast = head; while (fast->next && fast->next->next) { slow = slow->next; fast = fast->next->next; } //分割链表成两部分 ListNode *midNode = slow->next; slow->next = NULL; //翻转链表后半部分 ListNode *pre = midNode, *cur; while (pre && (cur = pre->next)) { pre->next = cur->next; cur->next = midNode; midNode = cur; } //插入 cur = head; ListNode *subCur; while ((subCur = midNode)) { midNode = subCur->next; subCur->next = cur->next; cur->next = subCur; cur = cur->next->next; } //return head; }};
阅读全文
0 0
- [LeetCode]143.Reorder List
- LeetCode 143. Reorder List
- [leetcode] 143.Reorder List
- leetcode 143. Reorder List
- 143. Reorder List LeetCode
- LeetCode 143. Reorder List
- LeetCode 143. Reorder List
- LeetCode 143. Reorder List
- LeetCode *** 143. Reorder List
- [Leetcode] 143. Reorder List
- leetcode.143. Reorder List
- LeetCode 143. Reorder List
- LeetCode-143.Reorder List
- LeetCode - 143. Reorder List
- LeetCode 143. Reorder List
- leetcode 143. Reorder List
- Leetcode 143. Reorder List
- [LeetCode] 143. Reorder List
- oracle 除数为0,默认为0的自定义函数
- shell脚本批量增加用户
- arm 分布式存储性能测试报告
- 数据库乐观锁与悲观锁
- 从头到尾彻底理解傅里叶变换算法(下)
- LeetCode 143. Reorder List
- python3基本语法
- char * 和 wchar*的转换
- 从MySQL和MongoDB的对比,看SQL与NoSQL的较量
- Latex新人教程
- 【云星数据---Apache Flink实战系列(精品版)】:Apache Flink批处理API详解与编程实战003--DateSet实用API详解003
- android 检查电话号码是否合理(含大陆和香港格式)
- JS 语法演示
- 使用过滤器(Filter)解决请求参数中文乱码问题(复杂方式)