题解 | #单链表的排序#

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
        ListNode list = new ListNode(0);
        ListNode p = head;
        int cnt = 0;
        while(p != null){
            cnt++;
            p = p.next;
        }
        int[] temp = new int[cnt];
        int t = 0;
        while(head != null){
            temp[t++] = head.val;
            head = head.next;
        }
        Arrays.sort(temp);
        ListNode q = list;
        for(int num : temp){
            q.next = new ListNode(num);
            q = q.next;
        }
        return list.next;
    }
}