[Leetcode] 21. Merge Two Sorted Lists 解题报告
来源:互联网 发布:linux设置ntp客户端 编辑:程序博客网 时间:2024/05/19 14:37
题目:
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.
思路:
Easy级别的题目,没有特别的技巧。还是那句老话,在链表处理中如果能加一个虚拟头结点,可以避免处理节点为空等特殊情况,让代码看起来更加的简洁和优雅。此外,在while循环中,将循环条件改为(l1 && l2),可以在某一链表到达末尾的时候提前返回,从而总体上减少运行时间。
代码:
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode pre_head(0), *p = &pre_head; // virtual head node while(l1 && l2) { if(l1->val < l2->val) { p->next = l1; l1 = l1->next; } else { p->next = l2; l2 = l2->next; } p = p->next; } if(l1) p->next = l1; else p->next = l2; return pre_head.next; }};
0 0
- LeetCode解题报告--Merge Two Sorted Lists
- 【LeetCode】Merge Two Sorted Lists 解题报告
- [LeetCode] Merge Two Sorted Lists 解题报告
- Leetcode Merge Two Sorted Lists 解题报告
- [leetcode] 21. Merge Two Sorted Lists 解题报告
- [Leetcode] 21. Merge Two Sorted Lists 解题报告
- leetcode解题报告21. Merge Two Sorted Lists
- LeetCode Merge k Sorted Lists 解题报告
- 【LeetCode】Merge k Sorted Lists 解题报告
- LeetCode解题报告--Merge k Sorted Lists
- [LeetCode] Merge k Sorted Lists 解题报告
- [LeetCode] Merge k Sorted Lists 解题报告
- 21. Merge Two Sorted Lists leetcode(lists)
- Leetcode #21 Merge Two Sorted Lists 合并有序链表 解题报告
- Merge Two Sorted Lists——解题报告
- [LeetCode]21.Merge Two Sorted Lists
- LeetCode --- 21. Merge Two Sorted Lists
- LeetCode 21.Merge Two Sorted Lists
- Spring Web Flow入门(带详细注释)
- maven环境变量配置
- Sublime Text 3 安装 Package Control
- 如何执行字符串的PHP代码
- Ajax异步传输的使用
- [Leetcode] 21. Merge Two Sorted Lists 解题报告
- 自学-ShiroFilter的工作原理-03
- 2016年前端面试总结(实习生)
- linux入门
- Effetive C++条款摘录
- linux scp 后台运行
- Android中APK打包流程
- BITMAPINFOHEADER 与BITMAPFILEHEADER及BMP详解
- 39. Combination Sum [leetcode][javascript解法]