Insertion Sort List 链表插入排序@LeetCode

原创于 2013-11-21 09:39:17 发布 · 2.4k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

Leetcode

LeetCode专栏

本文介绍了一种使用插入排序算法对链表进行排序的方法。通过示例代码详细展示了如何逐步将链表元素按顺序插入到已排序的部分。此外，提供了一个简化版的实现思路，利用虚拟头结点构建有序链表。

原理很简单，就是插入排序，只是由于链表的性质所以必须从前向后查找该插入的位置。

但是很容易有各种小bug，一遍能做到bug-free有难度。

package Level4;

import Utility.ListNode;

/**
 * Insertion Sort List 
 * 
 *  Sort a linked list using insertion sort.
 *
 */
public class S135 {

	public static void main(String[] args) {
		ListNode head = new ListNode(4);
		ListNode n2 = new ListNode(2);
		ListNode n3 = new ListNode(1);
		ListNode n4 = new ListNode(3);
		ListNode n5 = new ListNode(1);
		head.next = n2;
		n2.next = n3;
		n3.next = n4;
//		n4.next = n5;
//		ListNode ret = insertionSortList(head);
//		ret.print();
		
		int[] list = {-84,142,41,-17,-71,170,186,183,-21,-76,76,10,29,81,112,-39,-6,-43,58,41,111,33,69,97,-38,82,-44,-7,99,135,42,150,149,-21,-30,164,153,92,180,-61,99,-81,147,109,34,98,14,178,105,5,43,46,40,-37,23,16,123,-53,34,192,-73,94,39,96,115,88,-31,-96,106,131,64,189,-91,-34,-56,-22,105,104,22,-31,-43,90,96,65,-85,184,85,90,118,152,-31,161,22,104,-85,160,120,-31,144,115};
//		int[] list = {1,0,2,1};
//		int[] list = {1,2,-1,0};
		ListNode dum = ListNode.create(list);
//		dum.print();
		
		ListNode ret = insertionSortList(dum);
		ret.print();
	}
	
	public static ListNode insertionSortList(ListNode head) {
        if(head==null || head.next==null){
        	return head;
        }
        
        ListNode p = head;		// 前后两个指针
        ListNode q = head.next;
        
        while(p!=null && q!=null){
        	if(p.val <= q.val){	// 递增顺序，无需交换，继续往前寻找
        		p = q;
        		q = q.next;
        	}else{			// out of order！
        		ListNode h = head;
        		if(head.val >= q.val){		// q元素比head元素还小的情况
        			ListNode qnext = q.next;
        			p.next = qnext;
        			q.next = head;
        			head = q;		// 更新链表头
        			q = qnext;		// 更新q的位置，让q继续往前寻找
        		}else{
        			while(h.val<=q.val && h.next.val<=q.val){	// 从head开始找，查找哪里适合放置q元素，注意元素相等的情况！
        				h = h.next;
        			}
        			if(h.val<=q.val && q.val<=h.next.val){		// 把q元素插入适当的地方
        				ListNode qnext = q.next;
        				p.next = qnext;
        				q.next = h.next;
        				h.next = q;
        				q = qnext;		// 更新q的位置，让q继续往前寻找
        			}
        		}
        	}
        }
        
        return head;
    }
}

下面是一种简单得多的方法：建立dummy节点，然后从dummy节点出发，构建有序链表，即现在有两个链表：一个是以head为头的无序链表，另一个是以dummy为头的有序链表。过程就是每次从头遍历有序链表，找到下一个适合无序链表头插入的地方。最终所有的无序链表都转移到了有序链表。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode insertionSortList(ListNode head) {
        ListNode dummy = new ListNode(0); // From dummy node, we will create a sorted linkedlist
        
        ListNode cur = head;
        while(cur != null) {
            ListNode pre = dummy;   // pre is used to find the place to insert
            while(pre.next!=null && cur.val>pre.next.val) { // find the element which small enough to be inserted
                pre = pre.next;
            }
            ListNode next = cur.next;   // unlink from unorder linkedlist and link to order linkedlist
            cur.next = pre.next;
            pre.next = cur;
            cur = next;
        }
        return dummy.next;
    }
}