合并两个链表,递归算法
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2){
if(l1 == NULL)return l2;//若l1为空返回l2
if(l2 == NULL)return l1;//若l2为空返回l1
if(l1->val < l2->val){
l1->next = mergeTwoLists(l1 ->next,l2);//l1.val小于l2.val递归l2并将其连接在l1后
return l1;
}else{
l2->next = mergeTwoLists(l1,l2->next);
return l2;
}
}