Merge Two Sorted Lists solution

Author: PDKhan

merge-two-sorted-lists/PDKhan.cpp

@@ -0,0 +1,37 @@
+class Solution {
+    public:
+        ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
+            ListNode* new_head = NULL;
+            ListNode* tail;
+    
+            while(list1 || list2){
+                ListNode* curr;
+    
+                if(list1 && list2){
+                    if(list1->val < list2->val){
+                        curr = list1;
+                        list1 = list1->next;
+                    }else{
+                        curr = list2;
+                        list2 = list2->next;
+                    }
+                }else if(list1){
+                    curr = list1;
+                    list1 = list1->next;
+                }else{
+                    curr = list2;
+                    list2 = list2->next;
+                }
+    
+                if(new_head == NULL){
+                    new_head = curr;
+                    tail = new_head;
+                }else{
+                    tail->next = curr;
+                    tail = tail->next;
+                }
+            }
+    
+            return new_head;
+        }
+    };