题目:
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
//可用递归,相对简洁但是这里用新链表来存储
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
typedef struct listNode{
int val;
struct listNode *next;
};
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
struct ListNode *l3,*l4,*l5;
l3=(struct listNode *)malloc(sizeof(struct listNode));
l4=l3;
while(l1||l2)
{
l5=(struct listNode *)malloc(sizeof(struct listNode));
if(l1&&l2){
if(l1->val<=l2->val)
{
l5->val=l1->val;
l1=l1->next;
}else {
l5->val=l2->val;
l2=l2->next;
}
}else if(l1){
l5->val=l1->val;
l1=l1->next;
}else {
l5->val=l2->val;
l2=l2->next;
}
l4->next=l5;
l4=l5;
}
l4->next=NULL;
return l3=l3->next;
}
递归:
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
if(l1==NULL)return l2;
if(l2==NULL)return l1;
if(l1->val < l2->val){
l1->next = mergeTwoLists(l1->next,l2);
return l1;
}else{
l2->next = mergeTwoLists(l1,l2->next);
return l2;
}
}
第一个为递归代码