- 题目:给一个链表进行排序
- 难度:Medium
- 思路:数组通过下标进行访问,而链表与数组不同,只能通过指针移动来遍历,所以对于数组排序的7大算法,并不是都适合链表排序。归并和快排都是基于递归的思想的,递归的做法对于链表也是适用的(定义两个指针,一个快一个慢,找到链表的中点,对排好序的左右两边的链表进行合并)
- 代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode sortList(ListNode head) {
if(head == null || head.next == null){
return head;
}
ListNode slow = head;
ListNode fast = head;
ListNode pre = null;
while(fast != null && fast.next != null){
pre = slow;
slow = slow.next;
fast = fast.next.next;
}
pre.next = null;
ListNode l1 = sortList(head);
ListNode l2 = sortList(slow);
return merge(l1,l2);
}
private ListNode merge(ListNode l1, ListNode l2){
ListNode newHead = new ListNode(0);
ListNode node = newHead;
while(l1 != null && l2 != null){
if(l1.val < l2.val){
node.next = l1;
l1 = l1.next;
}else{
node.next = l2;
l2 = l2.next;
}
node = node.next;
}
if(l1 != null){
node.next = l1;
}
if(l2 != null){
node.next = l2;
}
return newHead.next;
}
}