合并两个有序单链表
2014-01-07 08:39
316 查看
题目原型:
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.
直接贴代码吧:
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.
直接贴代码吧:
public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1==null&&l2==null) return null; else if(l1==null) return l2; else if(l2==null) return l1; else { ListNode p,q,head,t; p = l1; q = l2; head = p.val<=q.val?p:q; while(p!=null&&q!=null) { if(p.val<=q.val) { t = p.next; if(t!=null) if(q.val<t.val) { p.next = q; p = t; } else { p = t; } else { p.next = q; break; } } else { t = q.next; if(t!=null) if(p.val<=t.val) { q.next = p; q = t; } else { q = t; } else { q.next = p; break; } } } return head; }
相关文章推荐
- 两个有序单链表合并成一个有序单链表的java实现
- 面试题---两个有序单链表的合并
- java 合并两个有序单链表
- 合并两个有序单链表的递归方法
- 合并两个有序单链表(Java)
- 数据结构 — 1. 两个非递减有序单链表合并为非递增有序单链表
- LeetCode 21. Merge Two Sorted Lists 合并两个有序单链表 C++
- 经典算法之两个有序单链表合并
- 两个有序单链表的合并
- Java单链表基本操作(八)--合并两个有序单链表
- LeetCode 21. Merge Two Sorted Lists(合并两个有序单链表)
- 21-Merge Two Sorted Lists-合并两个有序单链表
- 编程实现合并两个有序单链表
- 合并两个有序单链表
- Leetcode:Merge Two Sorted Lists 合并两个有序单链表
- c++ 创建有序单链表,以及两个有序单链表合并
- 编程实现两个有序单链表的合并
- java编程实现将两个有序单链表LA,LB合并成新的LA
- 合并两个有序单链表
- 两个有序单链表合并