[Leetcode]-Merge Two Sorted Lists
来源：互联网 发布：软件开发培训机构 编辑：程序博客网 时间：2024/05/17 00:04
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
题目：合并两个排序后的单链表，要求合并之后也是排序好的
思路：递归合并
/** * 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;} 1 0
- LeetCode: Merge Two Sorted Lists
- [Leetcode] Merge Two Sorted Lists
- Leetcode: Merge Two Sorted Lists
- [LeetCode] Merge Two Sorted Lists
- [Leetcode] Merge two sorted lists
- leetcode Merge Two Sorted Lists
- [LeetCode]Merge Two Sorted Lists
- [leetcode]Merge Two Sorted Lists
- LeetCode-Merge Two Sorted Lists
- [leetcode] Merge Two Sorted Lists
- [LeetCode] Merge Two Sorted Lists
- LeetCode - Merge Two Sorted Lists
- LeetCode:Merge Two Sorted Lists
- LeetCode | Merge Two Sorted Lists
- 【leetcode】Merge Two Sorted Lists
- Leetcode: Merge Two Sorted Lists
- 【LeetCode】Merge Two Sorted Lists
- Leetcode Merge Two Sorted Lists
- Unity里面三角面数
- 斜坡光照阴影算法
- Web开发之环境搭建
- Linux下新手如何将VIM配置成C++编程环境（可以STL自动补全）
- Objective-C中的instancetype和id区别
- [Leetcode]-Merge Two Sorted Lists
- Sample Code地址
- 测试看看博客样式
- 字符串查找算法：bm算法
- 杂记，本人用的~方便查询~~省的满世界找
- tomcat部署web应用(转)
- UVa - 100 - The 3n + 1 problem
- c#向Access数据库中批量插入大量记录的方法
- Spring+ActiveMQ实现消息的交换
