Leetcode Problem.21—Merge Two Sorted Lists
来源：互联网 发布：linux 进程逻辑地址 编辑：程序博客网 时间：2024/05/24 05:51
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.
My C++ solution！
<span style="font-size:14px;">ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode *l=new ListNode(0);ListNode *t=l;if(l1==NULL&&l2==NULL)return l1;else if(l1==NULL)return l2;else if(l2==NULL)return l1;else{while(l1||l2){if(l1&&l2){ListNode *temp=(l1->val>l2->val)?l2:l1;t->next=temp;t=t->next;if(l1->val>l2->val)l2=l2->next;elsel1=l1->next;}else if(l1){ListNode *temp=l1;t->next=temp;t=t->next;l1=l1->next;}else{ListNode *temp=l2;t->next=temp;t=t->next;l2=l2->next;}}}return l->next;}</span> 0 0
- Leetcode Problem.21—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
- leetCode #21 Merge Two Sorted Lists
- leetcode 21 Merge Two Sorted Lists
- [Leetcode 21, Easy] Merge Two Sorted Lists
- LeetCode 21 Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- 【leetcode】【单链表】【21】Merge Two Sorted Lists
- python2.7+pip+virtualenv
- java 内存分配和String类型的深度解析
- IOS多语言环境自由切换
- 夜维执行慢的原因探究
- iptables 初探
- Leetcode Problem.21—Merge Two Sorted Lists
- java DelayQueue 延期队列 21.7.3 -------thinking java 4
- Leetcode Problem.26—Remove Duplicates from Sorted Array
- Linux下php安装zlib扩展
- HDU 5265 序列变换 —— 最长不降子序列
- 编程之思考
- SQL Server数据库添加100条数据
- 证明SJF(Shortest Job First:最短作业优先算法)策略生成的调度方案理论最优
- Leetcode Problem.27—Remove Element
