链表插入排序 lintcode

最新推荐文章于 2018-02-18 23:00:36 发布

青峰祭坛

最新推荐文章于 2018-02-18 23:00:36 发布

阅读量501

点赞数

分类专栏： lintcode 文章标签：插入排序链表 lintcode

本文链接：https://blog.csdn.net/u014470581/article/details/52846410

版权

lintcode 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

链表插入排序

用插入排序对链表排序

您在真实的面试中是否遇到过这个题？

Yes

样例

Given 1->3->2->0->null, return 0->1->2->3->null

package tju.cs.bigdata.chc;


public class ListNode {
	int val;
	ListNode next;

	ListNode(int val) {
		this.val = val;
		this.next = null;
	}
	
	public ListNode createList(String s){
		ListNode res = new ListNode(-1);
		String[] strings = s.split("->");
		ListNode cur = res;
		for(String st : strings){
			if(!st.equals("null"))cur.next = new ListNode(Integer.parseInt(st));
			cur = cur.next;
		}
		
		return res.next;
	}
	public void printList(ListNode l){
		ListNode cur = l;
		if(l == null)return;
		while(cur != null){
			System.out.print(cur.val + " ");
			cur = cur.next;
		}
	}
}

package tju.cs.bigdata.chc;


public class InsertionSortList {
	   public ListNode insertionSortList(ListNode head) {
	        // write your code here
	        if(head == null || head.next == null){
	            return head;
	        }
	        ListNode res = new ListNode(-1);
	        ListNode cur = head;
	        ListNode curtmp = res;
	        while(cur != null){
	            curtmp = res;
	            
	            while(curtmp.next != null && curtmp.next.val <= cur.val){
	                curtmp = curtmp.next;
	            }
//	            curtmp.printList(curtmp);
//	            cur.printList(cur);
	            ListNode l = cur.next;
	            cur.next = curtmp.next;
	            curtmp.next = cur;
	            cur = l;
//	            if(cur != null)cur.printList(cur);
//	            curtmp.printList(curtmp);
	        }        
	        return res.next;
	        
	    }
	   public static void main(String[] args){
		   String string = "1->3->2->0->null";
		   ListNode res = new ListNode(-1).createList(string);
		   res.printList(res);
		   InsertionSortList insertionSortList = new InsertionSortList();
		   ListNode res1 = insertionSortList.insertionSortList(res);
		   res1.printList(res1);
	   }
}