sort-list

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

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

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_1.jpg" style="width: 450px; height: 194px;" />
<pre>
Input: head = [4,2,1,3]
Output: [1,2,3,4]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/14/sort_list_2.jpg" style="width: 550px; height: 184px;" />
<pre>
Input: head = [-1,5,3,4,0]
Output: [-1,0,3,4,5]
</pre>

Example 3:

<pre>
Input: head = []
Output: []
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the list is in the range <code>[0, 5 * 104]</code>.</li>
	<li><code>-105 &lt;= Node.val &lt;= 105</code></li>
</ul>

&nbsp;
Follow up: Can you sort the linked list in <code>O(n logn)</code> time and <code>O(1)</code> memory (i.e. constant space)?