题目链接:https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/
题目如下:
/**
* 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) {
ListNode* result=new ListNode(-1);
ListNode* pre =result;
while(l1||l2){
if(l1!=NULL&&l2!=NULL){
if(l1->val>l2->val){
pre->next=l2;
l2=l2->next;
}
else {
pre->next=l1;
l1=l1->next;
}
pre=pre->next;//!!!important,不然pre指针一直在原地next,没走到下一步
}
else if(l1==NULL&&l2!=NULL){
pre->next=l2;
return result->next;
}
else if(l1!=NULL&&l2==NULL){
pre->next=l1;
return result->next;
}
}
return result->next;
}
};