LeetCode题解——Merge Two Sorted Lists
来源：互联网 发布：知名net域名网站 编辑：程序博客网 时间：2024/05/24 07:35
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; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { if(l1 == NULL) return l2; if(l2 == NULL) return l1; if(l1->val < l2->val) { l1->next = mergeTwoLists(l1->next, l2); return l1; } else { l2->next = mergeTwoLists(l2->next, l1); return l2; } }}; 0 0
- LeetCode题解——Merge Two Sorted Lists
- LeetCode 21. Merge Two Sorted Lists 题解 —— Java
- leetcode 题解 || Merge Two Sorted Lists 问题
- LeetCode题解：Merge Two Sorted Lists
- LeetCode题解：Merge Two Sorted Lists
- LeetCode题解：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题解-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
- LeetCode——Merge Two Sorted Lists
- LeetCode—Merge Two Sorted Lists
- vim删除命令
- 39. Combination Sum
- 【多校第一场】【单调队列】HDU 5289 Assignment
- POJ 题目3692 Kindergarten（最大独立集）
- www.chevin.net
- LeetCode题解——Merge Two Sorted Lists
- 手把手教你在centos下编译安装配置高性能web服务器环境nginx+php(fast-cgi)+mysql等/适合小内存vps使用
- 设计模式 --6大法则 --迪米特法则
- 利用树莓派做智能小车
- 静态类和静态方法、接口和抽象类、内部类、单子设计模式
- <将来的你一定会感谢现在拼命的自己>读书随笔
- C语言if语句判断闰年平年
- 00-自测5. Shuffling Machine (20)
- 从零开始搭建hadoop分布式集群环境：（一）新建hadoop用户以及用户组
