首页 > 代码库 > Reorder List
Reorder List
Reorder List
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}.
说明：分三步，1。从中间分开，成两部分。2，后半部分链表逆置。3.插入合并。
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: void reorderList(ListNode *head) { if(head == NULL) return; ListNode *p1, *p2, *p3, *head2; p1 = p2 = head; while(p2->next && p2->next->next) { p1 = p1->next; p2 = p2->next->next; } head2 = p1->next; p1 = p1->next = NULL; p2 = head2; while(p2) { p3 = p2->next; p2->next = p1; p1 = p2; p2 = p3; } head2 = p1; p1 = head; while(head2 && p1) { p2 = head2->next; head2->next = p1->next; p1->next = head2; head2 = p2; p1 = p1->next->next; } }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。