[leetcode]Merge Two Sorted Lists
2013-07-25 20:37
387 查看
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(!l1) return l2;
if(!l2) return l1;
if(l1->val < l2->val){
l1->next = mergeTwoLists(l1->next, l2);
return l1;
}else{
l2->next = mergeTwoLists(l2->next, l1);
return l2;
}
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [Leetcode 21, Easy] Merge Two Sorted Lists
- leetcode----Merge Two Sorted Lists
- LeetCode 021 Merge Two Sorted Lists
- 【LeetCode】Merge Two Sorted Lists 解题报告（Java & Python)
- LeetCode-Merge Two Sorted Lists
- LeetCode 21 Merge Two Sorted Lists
- 【LeetCode】Merge Two Sorted Lists和Add TwoNumber解题报告
- LeetCode 21. Merge Two Sorted Lists
- LeetCode 21:Merge Two Sorted Lists
- [leetcode] Merge Two Sorted Lists
- [leetcode]21. Merge Two Sorted Lists(java)
- [Leetcode] Merge Two Sorted Lists
- LeetCode 21. Merge Two Sorted Lists
- [Leetcode] Merge Two Sorted Lists
- Leetcode || Merge Two Sorted Lists
- [LeetCode By Python] 21. Merge Two Sorted Lists
- ( Leetcode 21 ) Merge Two Sorted Lists
- [LeetCode]Merge Two Sorted Lists
- Leetcode:Merge Two Sorted Lists
- 【Leetcode】之Merge Two Sorted Lists