feat: add solutions to lc problem: No.0203. Remove Linked List Elements

Author: maolonglong

solution/0200-0299/0203.Remove Linked List Elements/README.md

@@ -97,6 +97,45 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    ListNode* removeElements(ListNode* head, int val) {
+        ListNode* dummy = new ListNode();
+        dummy->next = head;
+        ListNode* p = dummy;
+        while (p->next) {
+            if (p->next->val == val) {
+                p->next = p->next->next;
+            } else {
+                p = p->next;
+            }
+        }
+        return dummy->next;
+    }
+};
+```
+
+### **Go**
+
+```go
+func removeElements(head *ListNode, val int) *ListNode {
+	dummy := new(ListNode)
+	dummy.Next = head
+	p := dummy
+	for p.Next != nil {
+		if p.Next.Val == val {
+			p.Next = p.Next.Next
+		} else {
+			p = p.Next
+		}
+	}
+	return dummy.Next
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0203.Remove Linked List Elements/README_EN.md

@@ -88,6 +88,45 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    ListNode* removeElements(ListNode* head, int val) {
+        ListNode* dummy = new ListNode();
+        dummy->next = head;
+        ListNode* p = dummy;
+        while (p->next) {
+            if (p->next->val == val) {
+                p->next = p->next->next;
+            } else {
+                p = p->next;
+            }
+        }
+        return dummy->next;
+    }
+};
+```
+
+### **Go**
+
+```go
+func removeElements(head *ListNode, val int) *ListNode {
+	dummy := new(ListNode)
+	dummy.Next = head
+	p := dummy
+	for p.Next != nil {
+		if p.Next.Val == val {
+			p.Next = p.Next.Next
+		} else {
+			p = p.Next
+		}
+	}
+	return dummy.Next
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0203.Remove Linked List Elements/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    ListNode* removeElements(ListNode* head, int val) {
+        ListNode* dummy = new ListNode();
+        dummy->next = head;
+        ListNode* p = dummy;
+        while (p->next) {
+            if (p->next->val == val) {
+                p->next = p->next->next;
+            } else {
+                p = p->next;
+            }
+        }
+        return dummy->next;
+    }
+};

solution/0200-0299/0203.Remove Linked List Elements/Solution.go

@@ -0,0 +1,13 @@
+func removeElements(head *ListNode, val int) *ListNode {
+	dummy := new(ListNode)
+	dummy.Next = head
+	p := dummy
+	for p.Next != nil {
+		if p.Next.Val == val {
+			p.Next = p.Next.Next
+		} else {
+			p = p.Next
+		}
+	}
+	return dummy.Next
+}