Commit7bc5a35

committed

sort

1 parent499a088 commit7bc5a35Copy full SHA for 7bc5a35

File tree

+39

-0

lines changed

+39

-0

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,39 @@`
	`1`	`+packageAlgorithms.list;`
	`2`	`+`
	`3`	`+importAlgorithms.algorithm.others.ListNode;`
	`4`	`+`
	`5`	`+/**`
	`6`	`+ * Definition for singly-linked list.`
	`7`	`+ * public class ListNode {`
	`8`	`+ * int val;`
	`9`	`+ * ListNode next;`
	`10`	`+ * ListNode(int x) {`
	`11`	`+ * val = x;`
	`12`	`+ * next = null;`
	`13`	`+ * }`
	`14`	`+ * }`
	`15`	`+ */`
	`16`	`+publicclassInsertionSortList {`
	`17`	`+publicListNodeinsertionSortList(ListNodehead) {`
	`18`	`+ListNodedummy =newListNode(0);`
	`19`	`+`
	`20`	`+while (head !=null) {`
	`21`	`+ListNodepre =dummy;`
	`22`	`+`
	`23`	`+// 注意，这里要用<= 来保证算法的稳定性`
	`24`	`+// 因为假如有2个数相同，后面的数后找到，也要插入到后面才可以。也就是说当=的时候，是继续往下走`
	`25`	`+while (pre.next !=null &&pre.next.val <=head.val) {`
	`26`	`+pre =pre.next;`
	`27`	`+ }`
	`28`	`+`
	`29`	`+// unlink the node from the original link. And record the next position.`
	`30`	`+ListNodeheadNext =head.next;`
	`31`	`+head.next =pre.next;`
	`32`	`+`
	`33`	`+pre.next =head;`
	`34`	`+head =headNext;`
	`35`	`+ }`
	`36`	`+`
	`37`	`+returndummy.next;`
	`38`	`+ }`
	`39`	`+}`

Comments

(0)