1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part2

This commit is contained in:
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions

View File

@@ -0,0 +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>