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}
.
题目的思路是,找到中间节点,将后半截链表反转。将前半截链表和翻转后的链表进行遍历交叉组合。
/**
* 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)
return ;
ListNode p,q,pre;
p = getMid(head);
q = p.next;
p.next=null;
q=reverse(q);
p=head;
while(p!=null&&q!=null)
{
ListNode temp1 = p.next;
ListNode temp2 = q.next;
p.next=q;
q.next=temp1;
p=temp1;
q=temp2;
}
}
public static ListNode getMid(ListNode head)
{
ListNode p = head;
ListNode q = head;
while(q.next!=null&&q.next.next!=null)
{
q=q.next.next;
p=p.next;
}
return p;
}
public static ListNode reverse(ListNode head)
{
ListNode q = null,pre;
pre=head;
if(pre.next!=null)
{
q=pre.next;
pre.next=null;
}
while(q!=null)
{
ListNode temp=q.next;
q.next=pre;
pre=q;
q=temp;
}
return pre;
}
}