21. Merge Two Sorted Lists | 连接两个有序单链表
来源:互联网 发布:淘宝怎么去推广 编辑:程序博客网 时间:2024/05/29 03:28
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. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public 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);} else {l2.next = mergeTwoLists(l1, l2.next);}return l1.val < l2.val ? l1 : l2;}}
0 0
- 21. Merge Two Sorted Lists | 连接两个有序单链表
- Leetcode:Merge Two Sorted Lists 合并两个有序单链表
- LeetCode—Merge Two Sorted Lists融合两个有序单链表
- LeetCode 21. Merge Two Sorted Lists 合并两个有序单链表 C++
- LeetCode 21 Merge Two Sorted Lists 把两个链表有序连接
- 两个有序链表的合并 Merge Two Sorted Lists
- Merge Two Sorted Lists 合并两个有序链表@LeetCode
- [LeetCode]Merge Two Sorted Lists-合并两个有序链表
- Merge Two Sorted Lists 合并两个有序链表
- Leetcode Merge Two Sorted Lists 合并两个有序链表
- LeetCode-Merge Two Sorted Lists--链接两个有序链表
- Merge Two Sorted Lists, 合并两个有序链表
- (LeetCode)Merge Two Sorted Lists --- 合并两个有序序列
- Merge Two Sorted Lists(合并两个有序链表)
- Leetcode Merge Two Sorted Lists(合并两个有序表)
- leetcode Merge Two Sorted Lists 合并两个有序链表
- LeetCode 21. Merge Two Sorted Lists 两个有序列表合成一个
- 21. Merge Two Sorted Lists(合并有序链表)
- 非静态实例的初始化
- struts学习(第一天 )
- Java程序员
- CSMA介绍
- 秒杀系统架构分析与实战
- 21. Merge Two Sorted Lists | 连接两个有序单链表
- 二叉树的非递归遍历
- IntelliJ IDEA 工具技巧
- java基础之数据结构(持续完善)
- Win7中的软链接详解(mklink命令)
- jquery eval解析JSON中的注意点介绍
- 测试人员与开发人员沟通的一些问题
- CS8025号错误是什么
- SpringBoot--配置fastjson(日期格式转化)和热部署