LeetCode.题号147.对单链表进行排序

public class ListNode {

    public int val;
    public ListNode next;

    public ListNode(int x) {
        val = x;
    }

    // 链表节点的构造函数
    // 使用arr为参数，创建一个链表，当前的ListNode为链表头结点
    public ListNode(int[] arr){

        if(arr == null || arr.length == 0)
            throw new IllegalArgumentException("arr can not be empty");

        this.val = arr[0];
        ListNode cur = this;
        for(int i = 1 ; i < arr.length ; i ++){
            cur.next = new ListNode(arr[i]);
            cur = cur.next;
        }
    }

    // 以当前节点为头结点的链表信息字符串
    @Override
    public String toString(){

        StringBuilder s = new StringBuilder();
        ListNode cur = this;
        while(cur != null){
            s.append(cur.val + "->");
            cur = cur.next;
        }
        s.append("NULL");
        return s.toString();
    }
}

首先按照LeetCode提供的单链表类进行丰富。

public class insertion_sort_list {
    public ListNode insertionSortList(ListNode head) {
        if(head==null || head.next ==null)
            return head;
        ListNode dummyHead = new ListNode(-1);//创建虚空节点
        dummyHead.next = head;
        ListNode pre = head.next;
        while(pre!= null){
            ListNode cur = head;//每次遍历从原head的头部开始
            while(cur.next != pre.next ){
                if(pre.val < cur.val){
                    int temp = pre.val;
                    pre.val = cur.val;
                    cur.val = temp;
                }
                cur = cur.next;
            }
            pre = pre.next;
        }
        return dummyHead.next;//返回链表头
    }
    public static void main(String[] args){
        int[] arr = {7,3,4,6,8,9,1,2,5,0};
        ListNode head = new ListNode(arr);
        System.out.println(head);
        ListNode res = (new insertion_sort_list()).insertionSortList(head);
        System.out.println(res);
    }
}

因为链表不像数组可以通过下标寻址，所以每次比较大小的遍历是从头开始的。相关链接————插入排序