输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
限制:
0 <= 链表长度 <= 1000
1.分别遍历两个链表,把指向小的在继续遍历
/**
* 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 * l = new ListNode, *tp;
tp = l;
while(l1 != NULL && l2 != NULL){
if(l1->val <= l2->val){
l->next = l1;
l->next->val = l1->val;
l1 = l1->next;
}
else {
l->next = l2;
l->next->val = l2->val;
l2 = l2->next;
}
l = l->next;
}//处理剩余链表的节点
if(l1 == NULL) l->next = l2;
else if(l2 == NULL) l->next = l1;
return tp->next;
}
};