简单算法 单链表的排序(java)
描述
给定一个无序单链表,实现单链表的排序(按升序排序)。
示例1
输入:
[1,3,2,4,5]
返回值:
{1,2,3,4,5}
想法:
一开始看到这个算法时送就想到了暴力解法,值排序,通过将链表中的值取出到集合中,然后集合利用自带方法进行排序,再通过加强for循环传回排好序的值。如代码1.
不过之后我又想了一下,如果用这种方法肯定不是比较好的答案,实际运用起来问题肯定也比较大,所以我又通过查询资料找到了第二种方法,通过快慢结点找到中间结点,然后分为两个链表,一直分,知道无法分为止,然后自底而上排序归并,如代码2
代码1:
public ListNode sortInList (ListNode head) {
if(head == null || head.next == null) return head;
ListNode slow = head;
ArrayList<Integer> list = new ArrayList<>();
while(slow != null){
list.add(slow.val);
slow = slow.next;
}
slow = head;
Collections.sort(list);
int i = 0;
while(slow != null){
slow.val = list.get(i++);
slow = slow.next;
}
return head;
}
代码2:
public ListNode sortInList (ListNode head) {
if(head == null || head.next == null)
return head;
ListNode slow = head;
ListNode fast = head.next;
while(fast != null && fast.next != null){
slow = slow.next;
fast = fast.next.next;
}
ListNode newlist = slow.next;
slow.next = null;
ListNode left = sortInList(head);
ListNode right = sortInList(newlist);
ListNode lhead = new ListNode(-1);
ListNode res = lhead;
while(left != null && right !=null){
if(left.val <= right.val){
lhead.next = left;
left = left.next;
}else{
lhead.next = right;
right = right.next;
}
lhead = lhead.next;
}
lhead.next = left == null ? right : left;
return res.next;
}