coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 03:56:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
leetcode-cn/problem (English)/移除重复节点(English) [remove-duplicate-node-lcci].html
View File

@@ -1,26 +1,26 @@
<p>Write code to remove duplicates from an unsorted linked list.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: [1, 2, 3, 3, 2, 1]
<strong> Output</strong>: [1, 2, 3]
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: [1, 1, 1, 1, 2]
<strong> Output</strong>: [1, 2]
</pre>
<p><strong>Note: </strong></p>
<ol>
<li>The length of the list is within the range[0, 20000].</li>
<li>The values of the list elements are within the range [0, 20000].</li>
</ol>
<p><strong>Follow Up: </strong></p>
<p>How would you solve this problem if a temporary buffer is not allowed?</p>
<p>Write code to remove duplicates from an unsorted linked list.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: [1, 2, 3, 3, 2, 1]
<strong> Output</strong>: [1, 2, 3]
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: [1, 1, 1, 1, 2]