LeetCode-143.Reorder List

https://leetcode.com/problems/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}.

利用快慢指针获取到后半段链表，之后反转后半段链表或者使用栈存放，最后将两个子链表合并。

使用栈

 public void ReorderList(ListNode head)
        {
            if (head == null || head.next == null || head.next.next == null)
                return;
            ListNode slow = head, fast = head,node;
            while (fast != null && fast.next!=null)
            {
                slow = slow.next;
                fast = fast.next.next;
            }
            fast = slow.next;//需要改变位置的头节点
            slow.next = null;//断开连接将链表一分为二
            Stack<ListNode> s = new Stack<ListNode>();
            while (fast != null)
            {
                s.Push(fast);
                fast = fast.next;
            }
            slow = head;
            while (s.Count>0)
            {
                node = s.Pop();
                node.next = slow.next;
                slow.next = node;
                slow = node.next;
            }
        }

翻转链表

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution 
{
    public void ReorderList(ListNode head) 
    {
        if (head == null || head.next == null || head.next.next == null)
            return;
        ListNode slow = head, fast = head,node;
        while (fast != null && fast.next!=null)
        {
            slow = slow.next;
            fast = fast.next.next;
        }
        fast = slow.next;//需要改变位置的头节点
        slow.next = null;
        //反转链表
        fast = ReverseList(fast);
        slow = head;
        while (fast != null)
        {
            node = fast;
            fast = fast.next;
            node.next = slow.next;
            slow.next = node;
            slow = node.next;
        }
    }

    public ListNode ReverseList(ListNode head)
    {
        if (head == null || head.next == null)
            return head;
        ListNode pre = null, next;
        while (head != null)
        {
            next = head.next;
            head.next = pre;
            pre = head;
            head = next;
        }
        return pre;
    }
}