(leetcode) reorderlist

public class Solution {
    public void reorderList(ListNode head) {
        if (head == null || head.next == null){
            return;
        }
        ListNode chaser = head;
        ListNode runner = head;
        while  (runner.next != null && runner.next.next != null){
            chaser = chaser.next;
            runner = runner.next.next;
        }
        ListNode p1 = head;
        ListNode p2 = chaser.next;
        chaser.next = null;
        ListNode pre = null;
        while (p2 != null){
            ListNode temp = p2.next;
            p2.next = pre;
            pre = p2;
            p2 = temp;
        }
        p2 = pre;
        while (p1 != null && p2 != null){
            ListNode p1temp = p1.next;
            ListNode p2temp = p2.next;
            p1.next = p2;
            p1 = p1temp;
            p2.next = p1;
            p2 = p2temp;
        }
    }
}

首先快慢指针找到中点，然后切断，反转后半部分，然后将两个链表连接在一起。针对一些复杂问题，关于链表的边界问题一直想不清楚，p.next != null 还是 p!= null? 这里经验主义认为，涉及链表重组，结构改变都是p!=null,涉及快慢指针就是p.next !=null 还是靠直觉吧，空间逻辑一直都是头痛，线好多好难受！