-
Notifications
You must be signed in to change notification settings - Fork 171
/
InsertionSortList.java
40 lines (39 loc) · 1.02 KB
/
InsertionSortList.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
Author: King, [email protected]
Date: Jan 02, 2015
Problem: Insertion Sort List
Difficulty: Easy
Source: http://oj.leetcode.com/problems/insertion-sort-list/
Notes:
Sort a linked list using insertion sort.
Solution: ...
*/
/**
* 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) {
if (head == null || head.next == null) return head;
ListNode dummy = new ListNode(Integer.MIN_VALUE);
dummy.next = head;
ListNode cur = head.next;
head.next = null;
while (cur != null) {
ListNode tmp = dummy;
while (tmp.next != null && tmp.next.val <= cur.val) tmp = tmp.next;
ListNode next = cur.next;
cur.next = tmp.next;
tmp.next = cur;
cur = next;
}
return dummy.next;
}
}