class Solution { private static ListNode[] getAndRemoveTheSmallest(ListNode head) { if (head == null) { return null; } ListNode min = head; ListNode pre = null; ListNode minPre = null; ListNode[] result = new ListNode[2]; result[0] = head; while (head != null) { if (head.val < min.val) { min = head; minPre = pre; } pre = head; head = head.next; } if (minPre != null) { minPre.next = min.next; } else { result[0] = min.next; } min.next = null; result[1] = min; return result; } private static ListNode function(ListNode head) { if (head == null) { return null; } ListNode resultHead = null; ListNode resultTail = null; while (head != null) { ListNode[] noSorted = getAndRemoveTheSmallest(head); if (resultHead == null) { resultHead = noSorted[1]; resultTail = noSorted[1]; } else { resultTail.next = noSorted[1]; resultTail = resultTail.next; } head = noSorted[0]; } return resultHead; } private static void print(ListNode head) { while (head != null) { System.out.println(head.val); head = head.next; } } public static void main(String[] args) { ListNode n1 = new ListNode(1); ListNode n2 = new ListNode(0); ListNode n3 = new ListNode(1); ListNode n4 = new ListNode(4); ListNode n5 = new ListNode(5); ListNode n6 = new ListNode(2); ListNode n7 = new ListNode(7); ListNode n8 = new ListNode(8); n1.next = n2; n2.next = n3; n3.next = n4; n4.next = n5; n5.next = n6; n6.next = n7; n7.next = n8; ListNode head = function(n1); print(head); } } class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
链表选择排序
猜你喜欢
转载自blog.51cto.com/tianyiya/2339679
今日推荐
周排行