21. Merge Two Sorted Lists
来源：互联网 发布：补水的水乳推荐知乎 编辑：程序博客网 时间：2024/05/22 22:26
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 p1 = l1; ListNode p2 = l2; ListNode fakeHead = new ListNode(0); ListNode p = fakeHead; while(p1 != null && p2 != null){ if(p1.val <= p2.val){ p.next = p1; p1 = p1.next; }else{ p.next = p2; p2 = p2.next; } p = p.next; } if(p1 != null) p.next = p1; if(p2 != null) p.next = p2; return fakeHead.next; }} 0 0
- 21.Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21.Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- Oracle误删除数据恢复
- 网络编程2
- Some OJ
- A. Pasha and Stick
- 排序
- 21. Merge Two Sorted Lists
- 1011. A+B和C (15)
- SQL循环语句
- MySQL和SQL Server比较
- pragma code_seg
- Swift入门———逻辑分支
- 2015’12杭电校赛1002 Polygon （计算几何）
- 致简之美——EvaIO架构分享
- face++ c++接口 以及 curl 库的使用，json库在另一个博客介绍
