Sort a linked list using insertion sort.

Example

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

?

思路也比較直接，insertion sort，要注意的就是操作linkedlist的一些問題

?

/*** Definition for ListNode.* public class ListNode {* int val;* ListNode next;* ListNode(int val) {* this.val = val;* this.next = null;* }* }*/ public class Solution {/*** @param head: The first node of linked list.* @return: The head of linked list.*/public ListNode insertionSortList(ListNode head) {// write your code hereif(head == null || head.next == null)return head;ListNode fakehead = new ListNode(0);fakehead.next = head;ListNode prev = head;ListNode curr = head.next;while(curr != null){if(curr.val > prev.val){prev = curr;curr = curr.next;}else{ListNode p = fakehead;while(p != prev && p.next.val < curr.val)p = p.next;prev.next = curr.next;curr.next = p.next;p.next = curr;curr = prev.next;}}return fakehead.next;} }

?

轉載于:https://www.cnblogs.com/goblinengineer/p/5217197.html

總結

以上是生活随笔為你收集整理的lintcode-easy-Insertion Sort List的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。