Package g0101_0200.s0148_sort_list

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    148 - Sort List\.

    Medium

    Given the head of a linked list, return the list after sorting it in ascending order.

    Example 1:

    Input: head = 4,2,1,3

    Output: 1,2,3,4

    Example 2:

    Input: head = -1,5,3,4,0

    Output: -1,0,3,4,5

    Example 3:

    Input: head = []

    Output: []

    Constraints:

    • The number of nodes in the list is in the range <code>0, 5 * 10<sup>4</sup></code>.

    • <code>-10<sup>5</sup><= Node.val <= 10<sup>5</sup></code>

    Follow up: Can you sort the linked list in O(n logn) time and O(1) memory (i.e. constant space)?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final ListNode sortList(ListNode head)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait