mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-26 07:18:56 +08:00
26 lines
1023 B
HTML
26 lines
1023 B
HTML
<p>Given the <code>head</code> of a sorted linked list, <em>delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list</em>. Return <em>the linked list <strong>sorted</strong> as well</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/04/linkedlist1.jpg" style="width: 500px; height: 142px;" />
|
|
<pre>
|
|
<strong>Input:</strong> head = [1,2,3,3,4,4,5]
|
|
<strong>Output:</strong> [1,2,5]
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/04/linkedlist2.jpg" style="width: 500px; height: 205px;" />
|
|
<pre>
|
|
<strong>Input:</strong> head = [1,1,1,2,3]
|
|
<strong>Output:</strong> [2,3]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the list is in the range <code>[0, 300]</code>.</li>
|
|
<li><code>-100 <= Node.val <= 100</code></li>
|
|
<li>The list is guaranteed to be <strong>sorted</strong> in ascending order.</li>
|
|
</ul>
|