From f45b1f1d28a668e2c90ad66ac0d2141d59fc73ae Mon Sep 17 00:00:00 2001
From: jianghongcheng <35664721+jianghongcheng@users.noreply.github.com>
Date: Wed, 3 May 2023 16:19:13 -0500
Subject: [PATCH] =?UTF-8?q?Update=200203.=E7=A7=BB=E9=99=A4=E9=93=BE?=
 =?UTF-8?q?=E8=A1=A8=E5=85=83=E7=B4=A0.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0203.移除链表元素.md | 20 +++++++++++++-------
 1 file changed, 13 insertions(+), 7 deletions(-)

diff --git a/problems/0203.移除链表元素.md b/problems/0203.移除链表元素.md
index b52f16ea..6a0de282 100644
--- a/problems/0203.移除链表元素.md
+++ b/problems/0203.移除链表元素.md
@@ -307,21 +307,27 @@ public ListNode removeElements(ListNode head, int val) {
 Python：
 
 ```python
+（版本一）虚拟头节点法
 # Definition for singly-linked list.
 # class ListNode:
 #     def __init__(self, val=0, next=None):
 #         self.val = val
 #         self.next = next
 class Solution:
-    def removeElements(self, head: ListNode, val: int) -> ListNode:
-        dummy_head = ListNode(next=head) #添加一个虚拟节点
-        cur = dummy_head
-        while cur.next:
-            if cur.next.val == val:
-                cur.next = cur.next.next #删除cur.next节点
+    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
+        # 创建虚拟头部节点以简化删除过程
+        dummy_head = ListNode(next = head)
+        
+        # 遍历列表并删除值为val的节点
+        current = dummy_head
+        while current.next:
+            if current.next.val == val:
+                current.next = current.next.next
             else:
-                cur = cur.next
+                current = current.next
+        
         return dummy_head.next
+
 ```
 
 Go：