剑指offer 专项突破版 26、重排链表

题目链接

思路

• 此题最关键的一点在于把问题转化为，首先找到链表的中间结点把链表一分为二，之后再把后边的一半进行翻转，最后把后面的结点逐个插入到前面的结点中
• 注意一分为二和逐个插入的过程

class Solution {

    //返回反转后链表的头结点
    ListNode reverseList(ListNode head) {
        ListNode pre = null, now = head;

        while (null != now) {
            ListNode next = now.next;
            now.next = pre;
            pre = now;
            now = next;
        }
        return pre;
    }

    public void reorderList(ListNode head) {
        ListNode fast = head, slow = head;

        while (null != fast.next) {
            fast = fast.next;
            slow = slow.next;

            if (null != fast.next)
                fast = fast.next;
        }

        ListNode left = head, right = reverseList(slow.next);
        slow.next = null;

        while (null != left && null != right) {
            ListNode leftNext = left.next, rightNext = right.next;
            left.next = right;
            right.next = leftNext;
            left = leftNext;
            right = rightNext;
        }
    }
}

Go代码

func reverseList(head *ListNode) *ListNode {
	if nil == head || nil == head.Next {
		return head
	}
	var pre *ListNode
	now := head

	for now != nil {
		next := now.Next
		now.Next = pre
		pre = now
		now = next
	}
	return pre
}

func reorderList(head *ListNode) {
	if head.Next == nil || head.Next.Next == nil{
		return
	}

	fast, slow := head.Next.Next, head
	for fast != nil && fast.Next != nil {
		slow = slow.Next
		fast = fast.Next.Next
	}

	head1, head2 := head, reverseList(slow.Next)
    slow.Next = nil
	for head1.Next != nil && head2.Next != nil {
		next := head1.Next
		head1.Next = head2
		head1 = next
		next = head2.Next
		head2.Next = head1
		head2 = next
	}
	
	if head1.Next == nil{
		head1.Next = head2
	}
}