合并两个有序链表

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

示例：

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/merge-two-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

具体实现如下：
/**

• Definition for singly-linked list.
• struct ListNode {

• int val;
  

• struct ListNode *next;
  

• };
  */

struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2){
if ((l1 == NULL) && (l2 == NULL)) {
return l1;
}
if ((l1 != NULL) && (l2 == NULL)) {
return l1;
}
if ((l1 == NULL) && (l2 != NULL)) {
return l2;
}
struct ListNode* tmpHead = (struct ListNode*)malloc(sizeof(struct ListNode));
struct ListNode* resultList = tmpHead;
struct ListNode* resultHead = NULL;
while ((l1 != NULL) || (l2 != NULL)) {
if (l1 == NULL) {
/* 连接l2 /
while (l2 != NULL) {
resultList -> next = l2;
l2 = l2 -> next;
resultList = resultList -> next;
}
break;
}
if (l2 == NULL) {
/ 连接l1 */
while (l1 != NULL) {
resultList -> next = l1;
l1 = l1 -> next;
resultList = resultList -> next;
}
break;
}
if (l1 -> val > l2 ->val) {
resultList -> next = l2;
l2 = l2 -> next;
resultList = resultList -> next;
} else {
resultList -> next = l1;
l1 = l1 -> next;
resultList = resultList -> next;
}
}
resultList -> next = NULL;
resultHead = tmpHead -> next;
free(tmpHead);
return resultHead;
}