leetcode 21--Merge Two Sorted Lists 链表 合并
来源：互联网 发布：ubuntu邮箱服务器一键 编辑：程序博客网 时间：2024/05/16 11: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. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode p,dummy=new ListNode(0); p=dummy; while(l1!=null&&l2!=null){ if(l1.val<l2.val){ p.next=l1; l1=l1.next; } else{ p.next=l2; l2=l2.next; } p=p.next; } p.next=(l1==null?l2:l1); return dummy.next; }} 0 0
- 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 21. Merge Two Sorted Lists(链表)
- leetcode---merge-two-sorted-lists---链表
- 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
- IO学习（十四）总结IO学习1-13
- adb用不了，error: unknown host service的解决办法 (360的360MobileLoader.exe,QQ的tadb.exe)
- 记下今天
- 分别用自定义PopupWindow和自定义Dialog实现下拉菜单
- Extjs中的tree节点的操作
- leetcode 21--Merge Two Sorted Lists 链表 合并
- android - 如何在webview中调起拨号
- 读取配置文件，利用反射给类属性赋值，
- rabbitmq 笔记(自看)
- cut、sort及uniq工具简介
- mysql死锁几种情况的测试
- B树，B+树
- 20160509 GreenPlum3 基本语法
- RHEL6.2下挂载光驱安装软件
