diff --git a/src/main/java/leetcode/editor/cn/RemoveDuplicateNodeLcci.java b/src/main/java/leetcode/editor/cn/RemoveDuplicateNodeLcci.java
new file mode 100644
index 0000000..551e213
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/RemoveDuplicateNodeLcci.java
@@ -0,0 +1,72 @@
+//编写代码，移除未排序链表中的重复节点。保留最开始出现的节点。 
+//
+// 示例1: 
+//
+// 
+// 输入：[1, 2, 3, 3, 2, 1]
+// 输出：[1, 2, 3]
+// 
+//
+// 示例2: 
+//
+// 
+// 输入：[1, 1, 1, 1, 2]
+// 输出：[1, 2]
+// 
+//
+// 提示： 
+//
+// 
+// 链表长度在[0, 20000]范围内。 
+// 链表元素在[0, 20000]范围内。 
+// 
+//
+// 进阶： 
+//
+// 如果不得使用临时缓冲区，该怎么解决？ 
+// Related Topics 链表 
+// 👍 108 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.ListNode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+//面试题 02.01:移除重复节点
+public class RemoveDuplicateNodeLcci{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new RemoveDuplicateNodeLcci().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode removeDuplicateNodes(ListNode head) {
+        List<Integer> list = new ArrayList<>();
+        ListNode temp = head;
+        ListNode pro = null;
+        while (temp != null) {
+            if (list.contains(temp.val)) {
+                pro.next = temp.next;
+            } else {
+                list.add(temp.val);
+                pro = temp;
+            }
+            temp = temp.next;
+        }
+        return head;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/RemoveDuplicateNodeLcci.md b/src/main/java/leetcode/editor/cn/RemoveDuplicateNodeLcci.md
new file mode 100644
index 0000000..af4b29d
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/RemoveDuplicateNodeLcci.md
@@ -0,0 +1,27 @@
+<p>编写代码，移除未排序链表中的重复节点。保留最开始出现的节点。</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>
+
+<pre>
+<strong> 输入</strong>：[1, 1, 1, 1, 2]
+<strong> 输出</strong>：[1, 2]
+</pre>
+
+<p><strong>提示：</strong></p>
+
+<ol>
+<li>链表长度在[0, 20000]范围内。</li>
+<li>链表元素在[0, 20000]范围内。</li>
+</ol>
+
+<p> <strong>进阶：</strong></p>
+
+<p>如果不得使用临时缓冲区，该怎么解决？</p>
+<div><div>Related Topics</div><div><li>链表</li></div></div>\n<div><li>👍 108</li><li>👎 0</li></div>
\ No newline at end of file