Merge 2 Sorted Lists
来源:互联网 发布:mac系统软件卸载 编辑:程序博客网 时间:2024/06/08 07:18
合并两个有序链表:
P1 1-3-5-7-9
P2 2-4-6-8-10
首先选取P1.head 和P2.head 中较小的作为头结点。假设是P1.
那么Head的next节点应该是P1.next 和 p2 中较小的节点。即P1以P1.next 为头结点继续迭代。
代码(递归)
public static ListNode mergeLists(ListNode r1, ListNode r2) {
if (r1 == null) {
return r2;
}
if (r2 == null) {
return r1;
}
ListNode phead = null;
if (r1.val < r2.val) {
phead = r1;
phead.next = mergeLists(r1.next, r2);
} else {
phead = r2;
phead.next = mergeLists(r1, r2.next);
}
return phead;
}
0 0
- Merge 2 Sorted Lists
- 【Leetcode】Merge Two Sorted Lists (2 lists)
- LeetCode题解:Merge 2 Sorted Lists
- Leetcode (2) Merge Two Sorted Lists
- Merge K Sorted Lists
- Merge k Sorted Lists
- Merge k Sorted Lists
- Merge Two Sorted Lists
- Merge K Sorted Lists
- Merge k Sorted Lists
- Merge k Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge k Sorted Lists
- Merge k Sorted Lists
- Merge Two Sorted Lists
- Linux 进程间通信:共享内存
- 会话管理cookie与session
- 12-24 笔记
- Highcharts+NodeJS搭建数据可视化平台
- C终止进程的工具kill,killall,pkill和xkill
- Merge 2 Sorted Lists
- 银行收银系统(C#)
- response详解
- SSM框架搭建(Spring+SpringMVC+MyBatis)与easyui集成并实现增删改查实现
- 树莓派3B 内核模块编译
- C++
- 设计模式-策略模式
- Js操作cookie的函数,来自jquery
- 熵权法(循环求解)