Merge two sorted linked lists andreturnitasanew list. The new list should be made by splicing together the nodes ofthefirsttwo lists.
Subscribe to see which companies asked this question.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*///熟悉链表怎么用,有一个指向next的指针classSolution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* res = new ListNode(-1);
ListNode* cur = res;
while(l1 && l2){
if(l1 -> val < l2 -> val){
cur -> next = l1;
l1 = l1 -> next;
}
else{
cur -> next = l2;
l2 = l2 -> next;
}
cur = cur->next;
}
cur->next = l1 ? l1 : l2;
return res->next;
}
};