标签：link and code new should ade turn wol tput
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Example:
Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4
想法：逐个比较两个链表的数值，较小的值储存在新建的链表，以此类推，将两个链表合并成一个链表。使用递归的方式。
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) { struct ListNode* temp; struct ListNode* l3; if(l1 == NULL && l2 == NULL){ return NULL; } if(l1 == NULL && l2 != NULL ){ return l2; } if(l1 != NULL && l2 == NULL){ return l1; } if(l1->val <= l2->val){ l1->next = mergeTwoLists(l1->next,l2); return l1; }else{ l2->next = mergeTwoLists(l2->next,l1); return l2; } }
leetcode-21 Merge Two Sorted Lists
标签：link and code new should ade turn wol tput
原文地址：https://www.cnblogs.com/tingweichen/p/9860871.html
