From b64e6c10d62f33cb04bea4550a1abda35614b131 Mon Sep 17 00:00:00 2001
From: sangge-rockpi <2251250136@qq.com>
Date: Sat, 20 Jan 2024 22:52:11 +0800
Subject: [PATCH] update 21

---
 leetcode/21.py | 22 ++++++++++++++++------
 1 file changed, 16 insertions(+), 6 deletions(-)

diff --git a/leetcode/21.py b/leetcode/21.py
index 78bbf67..4f3417f 100644
--- a/leetcode/21.py
+++ b/leetcode/21.py
@@ -1,13 +1,23 @@
 # Merge Two Sorted Lists
 
+
 # Definition for singly-linked list
-# class ListNode:
-#     def __init__(self, val = 0, next = None):
-#         self.val = val
-#         self.next = next
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
 
 
 class Solution:
-    def mergeTwoLists(self, list1: list, list2: list):
-        new_list = list1 + list2
+    def mergeTwoLists(self, list1: ListNode, list2: ListNode):
+        new_list1 = []
+        while list1.next is not None:
+            new_list1.append(list1.val)
+            list1 = list1.next
+        new_list2 = []
+        while list2.next is not None:
+            new_list2.append(list2.val)
+            list2 = list2.next
+
+        new_list = new_list1 + new_list2
         return new_list.sort()