21 - 合并两个有序链表
- date: Dec.28th, 2019
- platform: windows
thinking
a recursive method is implemented.
code
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *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;
}
}
原文地址:https://www.cnblogs.com/litun/p/12112908.html
时间: 2024-07-31 11:08:52