1.
题目
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
知识点
- 链表遍历
关键代码
完整代码
/**
* 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)
return l2;
if (!l2)
return l1;
struct ListNode* head = (struct ListNode*)malloc(sizeof(struct ListNode)), *t = head;
while (l1 && l2){
if (l1->val < l2->val){
t->next = l1;
l1 = l1->next;
}
else{
t->next = l2;
l2 = l2->next;
}
t = t->next;
}
if (l1) t->next = l1;
else if (l2) t->next = l2;
return head->next;
}
};