题解 | #单链表的排序#

利用冒泡排序的原理解题，冒泡排序的语句稍做改进即可。

public class Solution {
    
    public ListNode sortInList (ListNode head) {
        if (head==null)
            return null;
        ListNode p = head;
        int len = 0;
        while (p!=null) {
            p = p.next;
            len++;
        }
        for (int i = 0; i<len; i++) {
            //添加一个链表指针
            ListNode p1 = head;
            for (int j = 0; j<len-i-1; j++) {
                if (p1.val>(p1.next).val) {
                    int temp = p1.val;
                    p1.val = (p1.next).val;
                    (p1.next).val = temp;
                }
                p1 = p1.next;
            }
        }
        return head;
    }
}