LeetCode 147. Insertion Sort List 链表插入排序 C++/Java

Sort a linked list using insertion sort.

A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.
With each iteration one element (red) is removed from the input data and inserted in-place into the sorted list

Algorithm of Insertion Sort:

 Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list.
 At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there.
 It repeats until no input elements remain.

Example 1:

Input: ->->->
Output: ->->->

Example 2:

Input: -->->->->
Output: -->->->->

解题思路：将原链表中元素一个一个取出来，在新链表中比较进行排序。时间复杂度为O(n2)，是一种效率并不是很高的算法，但是空间复杂度为O(1)，以高时间复杂度换取了低空间复杂度。

方法一（C++）

 ListNode* insertionSortList(ListNode* head) {
         ListNode* dummy=new ListNode(-),*cur=dummy;
         while(head){
             ListNode* t=head->next;
             cur=dummy;
             while(cur->next&&cur->next->val<=head->val)
                 cur=cur->next;
             head->next=cur->next;
             cur->next=head;
             head=t;
         }
         return dummy->next;
     }

（Java）

  public ListNode insertionSortList(ListNode head) {
         ListNode dummy=new ListNode(-1),cur=dummy;
         while(head!=null){
             ListNode t=head.next;
             cur=dummy;
             while(cur.next!=null&&cur.next.val<=head.val)
                 cur=cur.next;
             head.next=cur.next;
             cur.next=head;
             head=t;
         }
         return dummy.next;
     }

方法二：不符合题目中的要求，只是完成最基本的链表排序功能，借助vector中的sort排序方法。（C++）

  ListNode* insertionSortList(ListNode* head) {
         vector<int> m;
         while(head){
             m.push_back(head->val);
             head=head->next;
         }
         sort(m.begin(),m.end());
         ListNode* newhead=new ListNode(-);
         while(!m.empty()){
             ListNode* cur=new ListNode(m.back());
             m.pop_back();
             cur->next=newhead->next;
             newhead->next=cur;
         }
         return newhead->next;
     }