java 单链表快速排序

Posted 2021-05-07

public ListNode ListPartition(ListNode head,ListNode end){
    if(head==end) return head;
    ListNode p = head;
    ListNode q = p.next;
    int key = head.val;
    while(q!=end){
        if(q.val < key){
            p = p.next;
            swap(p,q);
        }
        q = q.next;
    }
    swap(p,head);
    return q;
}
public void swap(ListNode p,ListNode q){
    int temp = p.val;
    p.val = q.val;
    q.val = temp;
}
public void quickSortOfList(ListNode head,ListNode end){
    if(head!=null){
        ListNode t = ListPartition(head,end);
        quickSortOfList(head,t);
        quickSortOfList(t.next,end);
    }
}