mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-11 18:31:41 +08:00
批量更新数据
This commit is contained in:
@@ -1,13 +1,13 @@
|
||||
<p>编写代码,移除未排序链表中的重复节点。保留最开始出现的节点。</p>
|
||||
|
||||
<p> <strong>示例1:</strong></p>
|
||||
<p><strong>示例1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>:[1, 2, 3, 3, 2, 1]
|
||||
<strong> 输出</strong>:[1, 2, 3]
|
||||
</pre>
|
||||
|
||||
<p> <strong>示例2:</strong></p>
|
||||
<p><strong>示例2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong> 输入</strong>:[1, 1, 1, 1, 2]
|
||||
@@ -17,10 +17,10 @@
|
||||
<p><strong>提示:</strong></p>
|
||||
|
||||
<ol>
|
||||
<li>链表长度在[0, 20000]范围内。</li>
|
||||
<li>链表元素在[0, 20000]范围内。</li>
|
||||
<li>链表长度在[0, 20000]范围内。</li>
|
||||
<li>链表元素在[0, 20000]范围内。</li>
|
||||
</ol>
|
||||
|
||||
<p> <strong>进阶:</strong></p>
|
||||
<p><strong>进阶:</strong></p>
|
||||
|
||||
<p>如果不得使用临时缓冲区,该怎么解决?</p>
|
||||
|
Reference in New Issue
Block a user