Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Idea: this problem is combining merge sorting and ListNode.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
if(l1 == nullptr) return l2;
if(l2 == nullptr) return l1;
ListNode *head = new ListNode(-1);
ListNode *temp = head;
while(l1 != NULL && l2 != NULL){
if(l1->val <= l2->val){
temp->next = l1;
l1 = l1->next;
}else{
temp->next = l2;
l2 = l2->next;
}
temp = temp->next;
}
if(l1 == NULL){
temp->next = l2;
}else if(l2 == NULL){
temp->next = l1;
}
return head->next;
}
};