skip unnecessary while loops

Author: obzva

merge-two-sorted-lists/flynn.cpp

@@ -40,17 +40,8 @@ class Solution {
             node = node->next;
         }
 
-        while (p != nullptr) {
-            node->next = p;
-            p = p->next;
-            node = node->next;
-        }
-
-        while (q != nullptr) {
-            node->next = q;
-            q = q->next;
-            node = node->next;
-        }
+        if (p != nullptr) node->next = p;
+        if (q != nullptr) node->next = q;
 
         return head->next;
     }