143. 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 may not modify the values in the list's nodes, only nodes itself may be changed.

Example 1:

Given 1->2->3->4, reorder it to 1->4->2->3.

Example 2:

Given 1->2->3->4->5, reorder it to 1->5->2->4->3.

方法一：找到尾部，然后插入到第二个位置。头部指向头部的后序。如此循环。时间复杂夫为O(n*n)。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void reorderList(ListNode* head) {
        if(head && head->next)
        {
         ListNode* f = last(head);
         f->next = head->next;
         head->next = f;
         reorderList(f->next);
        }
            
    }
    ListNode* last(ListNode* head)
    {
        ListNode* temp = head;
        ListNode* ret;
        while(temp->next->next)
            temp = temp->next;
        ret = temp->next;
        temp->next = NULL;
            return ret;
    }
};

方法二：找到中点，后半段反转，然后合并两段链表。时间复杂度为O(n)。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void reorderList(ListNode* head) {
      if(head&&head->next&&head->next->next) 
      {	
       ListNode* slow = head;
       ListNode* fast = head->next->next;
       ListNode* head2;
       ListNode* temp;
       ListNode* curr2;
       while(fast&&fast->next)
       {
           slow = slow->next;
           fast = fast->next->next;
       }
        head2 = reverse(slow->next->next);
        
        slow->next->next = NULL;
     /*   while(head2)
        {
        	cout<<head2->val<<endl;
			head2 = head2->next; 
		}*/
        while(head&&head2)
        {
            curr2 = head2->next;
            temp = head->next;
            head->next = head2;
            head2->next = temp;
            head = temp;
            head2 = curr2;
        }
      }
    }
    ListNode* reverse(ListNode* head)
    {   
      
        ListNode* ret = head;
        ListNode* temp = head;
        ListNode* weiba = NULL;
        while(ret)
        {
        if(ret->next == NULL)
		break;	
        temp = ret->next;
        ret->next = weiba;
        weiba = ret;
        ret = temp;
        } 
        ret->next = weiba;
        return ret;
    }
};