[1,2,3,4,5] 需要变成 [1,5,2,4,3]
首先想到将链表分别两个部分:不用动的[1,2,3]和要动的[4,5]
那么如何分呢?
这里其实就是找中间结点的算法,用slow和fast指针就行。(这里记住找到4为新链表的首节点之后,要记住断开3,4)
然后保持第一个结点1不动,将第n个插入第2个前,第n-1个插入第三个前
那么怎么反向遍历要插入的链表呢?
因为要插入的部分是反向遍历的,所以想到要想后面的链表翻转。利用reverse函数
最后用while循环,将翻转的链表[5,4]插入[1,2,3]
that’s it!!!
算法复杂度是0(n)
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public void reorderList(ListNode head) {
if(head == null) return;
ListNode slow = head;
ListNode fast = head;
while(fast!=null&&fast.next!=null){
slow = slow.next;
fast = fast.next.next;
}
ListNode after = slow.next;
slow.next = null;
ListNode newhead = reverse(after);
ListNode p = newhead;
ListNode q = head;
while(p!=null){
ListNode temp = q.next;
ListNode next_p = p.next;
q.next = p;
p.next = temp;
q = temp;
p = next_p;
}
}
public ListNode reverse(ListNode head){
ListNode newhead = new ListNode(-1);
newhead.next = null;
ListNode p = head;
while(p!=null){
ListNode next_p = p.next;
ListNode temp = newhead.next;
newhead.next = p;
p.next = temp;
p=next_p;
}
return newhead.next;
}
}