合并两个有序链表
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
Merge Two Sorted Lists
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
解
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
struct ListNode a, *p = &a;
a.next = NULL;
while(l1 != NULL || l2 != NULL){
struct ListNode *node = (struct ListNode *)malloc(sizeof(*node));
node->next = NULL;
p->next = node;
p = node;
if(l1 != NULL){
if(l2 != NULL){
if(l1->val < l2->val){
node->val = l1->val;
l1 = l1->next;
}else{
node->val = l2->val;
l2 = l2->next;
}
}else{
node->val = l1->val;
l1 = l1->next;
}
}else{
node->val = l2->val;
l2 = l2->next;
}
}
return a.next;
}