【力扣LeetCode】21 合并两个有序链表

题目描述（难度易）

将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

链接

https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/

思路

1、要注意输入链表为空的情况
2、注意头结点的选取与处理
3、依次合并即可

代码

/**
 * 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* ans = NULL;
        if(l1 == NULL && l2 == NULL){
        	return NULL;
        }
        else if(l1 == NULL){
        	return l2;
        }
        else if(l2 == NULL){
        	return l1;
        }
        else{
        	ListNode* t1 = l1;
        	ListNode* t2 = l2;
        	if(t1->val < t2->val){
        		ans = t1;
        		t1 = t1->next;
        	}
        	else{
        		ans = t2;
        		t2 = t2->next;
        	}
        	ListNode* tans = ans;
        	while(t1&&t2){
        		if(t1->val < t2->val){
	        		tans->next = t1;
	        		t1 = t1->next;
	        		tans = tans->next;
	        	}
	        	else{
	        		tans->next = t2;
	        		t2 = t2->next;
	        		tans = tans->next;
	        	}
        	}
        	while(t1){
        		tans->next = t1;
	        	t1 = t1->next;
	        	tans = tans->next;
        	}
        	while(t2){
        		tans->next = t2;
	        	t2 = t2->next;
	        	tans = tans->next;
        	}
        }
        return ans;
    }
};