mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
28 lines
986 B
HTML
28 lines
986 B
HTML
|
<p>给定一个已排序的链表的头 <code>head</code> ， <em>删除原始链表中所有重复数字的节点，只留下不同的数字</em> 。返回 <em>已排序的链表</em> 。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/04/linkedlist1.jpg" style="height: 142px; width: 500px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>head = [1,2,3,3,4,4,5]
|
|||
|
|
<strong>输出：</strong>[1,2,5]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/01/04/linkedlist2.jpg" style="height: 164px; width: 400px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>head = [1,1,1,2,3]
|
|||
|
|
<strong>输出：</strong>[2,3]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>链表中节点数目在范围 <code>[0, 300]</code> 内</li>
|
|||
|
|
<li><code>-100 <= Node.val <= 100</code></li>
|
|||
|
|
<li>题目数据保证链表已经按升序 <strong>排列</strong></li>
|
|||
|
|
</ul>
|