题目:
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例2:
输入:l1 = [], l2 = []
输出:[]
示例3:
输入:l1 = [], l2 = [0]
输出:[0]
提示:
两个链表的节点数目范围是 [0, 50]
-100 <= Node.val <= 100
l1 和 l2 均按 非递减顺序 排列
解题代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* mergeTwoLists(struct ListNode* list1, struct ListNode* list2){
// 判断极端情况
if(list1 == NULL && list2 == NULL)
return NULL;
else if(list1 == NULL)
return list2;
else if(list2 == NULL)
return list1;
// retList 表示合并后的链表 retHead表示合并后的链表头
struct ListNode *retList = (struct ListNode *)malloc(sizeof(struct ListNode));
struct ListNode *retHead;
// 初始化链表
if(list1->val < list2->val){
retList->val = list1->val;
list1 = list1->next;
}else {
retList->val = list2->val;
list2 = list2->next;
}
retHead = retList;
// 遍历 哪个小retList 就等于哪个
while(list1 != NULL && list2 != NULL){
if(list1->val < list2->val){
retList->next = list1;
list1 = list1->next;
}else {
retList->next = list2;
list2 = list2->next;
}
retList = retList->next;
}
while(list1 != NULL){
retList->next = list1;
list1 = list1->next;
retList = retList->next;
}
while(list2 != NULL){
retList->next = list2;
list2 = list2->next;
retList = retList->next;
}
return retHead;
}