LeetCode Solutions : 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 itto {1,4,2,3}.

Considering the following steps:

* 1. split such list into two list, first and second, according to slow and fast point
* 2. reverse the second list
* 3. insert the second list into the first list

coding solution:

/*** Definition for singly-linked list.* class ListNode {*     int val;*     ListNode next;*     ListNode(int x) {*         val = x;*         next = null;*     }* }* */
public class Solution {public void reorderList(ListNode head) {if(head!=null&&head.next!=null){ListNode low=head;//1. split such list into two list, first and second, according to slow and fast pointListNode fast=head;while(fast.next!=null&&fast.next.next!=null){low=low.next;fast=fast.next.next;}ListNode first=head;ListNode second=low.next;low.next=null;second=reverse(second);//2. reverse the second listwhile(second!=null){//3. insert the second list into the first listListNode p1=first.next;ListNode p2=second.next;first.next=second;second.next=p1;first=p1;second=p2;}}}private ListNode reverse(ListNode head){if(head==null||head.next==null)return head;ListNode pre=head;ListNode cur=head.next;while(cur!=null){ListNode nextNode=cur.next;cur.next=pre;pre=cur;cur=nextNode;            }head.next=null;return pre;}
}

转载于:https://www.cnblogs.com/zfyouxi/p/4850687.html

LeetCode Solutions : Reorder List相关推荐

【重点】LeetCode 143. Reorder List
LeetCode 143. Reorder List Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4254860.html 这段代码有值得学习 ...
[LeetCode] 143. Reorder List_Middle tag: Linked List
Given a singly linked list L: L0→L1→-→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→- You may not mo ...
Leetcode Solutions - Part 2
1. Two Sum 给定一个整数数组 nums 和一个整数目标值 target,请你在该数组中找出和为目标值 target 的那两个整数,并返回它们的数组下标. 你可以假设每种输入只会对应一 ...
Leetcode Solutions - Part 1
回溯: 字符串的排列回溯:78. 子集给你一个整数数组 nums ,数组中的元素互不相同 .返回该数组所有可能的子集(幂集). 解集不能包含重复的子集.你可以按任意顺序返回解集. 示例 ...
leetcode之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 th ...
leetcode day5 -- Reorder List Linked List Cycle II
1. Reorder List Given a singly linked list L: L0→L1→-→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln ...
[Leetcode][JAVA] 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 th ...
Leetcode - 143. 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 may not mo ...
[leetcode]143. 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 th ...

LeetCode Solutions : Reorder List

LeetCode Solutions : Reorder List相关推荐

最新文章

热门文章