- 题目链接
- 代码:
/**
* 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 == NULL) return l2;
if(l2 == NULL) return l1;
ListNode* p1 = l1;
ListNode* p2 = l2;
ListNode* res = l1->val < l2->val ? l1 : l2;
ListNode* p3= res;
if(res == l1){
p1 = p1->next;
}
if(res == l2){
p2 = p2->next;
}
//cout<<"res->val:"<<res->val;
while(p1 && p2){
if(p1->val <= p2->val){
p3->next = p1;
p3 = p1;
p1 = p1->next;
}else if(p1->val > p2->val){
p3->next = p2;
p3 = p2;
p2 = p2->next;
}
}
p3->next = p1 ? p1 : p2;
return res;
}
};