LeetCode 21：Merge Two Sorted Lists
来源：互联网 发布：睿智大数据 编辑：程序博客网 时间：2024/04/30 17:38
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.
题目分析：对两个有序列表进行合并，这个是数据结构基本题目比较简单，代码如下：
class Solution {public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode head(-1);ListNode * tmp = &head;while (l1 && l2){if (l1->val < l2->val){tmp->next = l1;l1 = l1->next;}else{tmp->next = l2;l2 = l2->next;}tmp = tmp->next;}if (l1)tmp->next = l1;if(l2)tmp->next = l2;return head.next; }}; 2 0
- LeetCode(21)Merge Two Sorted Lists
- [LeetCode 21] Merge Two Sorted Lists Solution
- [leetcode 21] Merge Two Sorted Lists
- LeetCode 21:Merge Two Sorted Lists
- LeetCode | #21 Merge Two Sorted Lists
- [Leetcode] 21 - Merge Two Sorted Lists
- leetcode.21------------Merge Two Sorted Lists
- [leetcode]21 Merge Two Sorted Lists
- Leetcode NO.21 Merge Two Sorted Lists
- leetcode[21 链表]Merge Two Sorted Lists
- leetcode-21 Merge Two Sorted Lists
- leetCode #21 Merge Two Sorted Lists
- leetcode 21 Merge Two Sorted Lists
- [Leetcode 21, Easy] Merge Two Sorted Lists
- LeetCode 21 Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- 【leetcode】【单链表】【21】Merge Two Sorted Lists
- LeetCode 21 - Merge Two Sorted Lists
- http协议
- 南宁治疗肛周脓肿的偏方
- 去掉字符串<>
- 南宁做肛周脓肿手术视频
- 图（一）之邻接表Adjacency List
- LeetCode 21：Merge Two Sorted Lists
- 南宁肛周脓肿的最好药物
- mysql explain
- Hadoop之——命令行运行时指定参数
- 南宁肛周脓肿不手术行吗
- OD常用快捷键
- 83Remove Duplicates from Sorted List
- 南宁肛周脓肿能自己好吗
- 南宁看肛周脓肿挂什么科
