题解 | 单链表的排序

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 the head node
     * @return ListNode类
     */
    public ListNode sortInList (ListNode head) {
        // write code here
        List<Integer> list = new ArrayList<>();
        while(head != null){
            list.add(head.val);
            head = head.next;
        }
        Collections.sort(list);
        ListNode dummy = new ListNode(-1);
        ListNode tail = dummy;
        for(int i = 0;i<list.size();i++){
            tail.next = new ListNode(list.get(i));
            tail = tail.next;
        }
        return dummy.next;
    }
}

使用了java的arraylist 等同于c++里面的vector吧 之后新建链表就好了