[Leetcode]-merge Sorted Lists

Merge sorted linked lists and return it as a new list. The new list should is made by splicing together the nodes of the first of the lists.
Title: Merge two sorted single-linked lists, which are ordered after merging
Idea: Recursive merging

/** * Definition for singly-linked List.  * struct ListNode {* int val; * struct ListNode *next; * }; */ struct listnode* mergetwolists (struct listnode* L1, struct listnode* L2) {if (NULL = = L1) return  L2; if  (NULL = = L2)    return  L1;    struct listnode* mergelist = NULL; if     (L1->val  < L2->val )        {mergelist = L1;    Mergelist->next = Mergetwolists (L1->NEXT,L2);        } else  {mergelist = L2;    Mergelist->next = Mergetwolists (L1,l2->next); } return  mergelist;}  

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

[Leetcode]-merge Sorted Lists