LeetCode 21 Merge Two Sorted Lists
来源:互联网 发布:最火的网络用语 编辑:程序博客网 时间:2024/06/02 01:49
题目:
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.
题目链接
题意:
给两个有序的单链表,要求将这两个链表组成一个新的有序链表,返回新链表的头指针。
给了两个指针 l1 和 l2,分别指向第一个链表和第二个链表,主要思路就是利用循环判断当前 l1 所指向的 val 和 l2 所指向 val 谁小,让node指向小的那个,并循环下去,当有一个链表指针循环结束而另一个还没有,则令node指向剩余链表即可,因为,剩余的都要比现在所有的节点大,所给的节点是有序的。
代码如下:
class Solution {public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode* head = NULL, *node = NULL; if (!l1) return l2; if (!l2) return l1; if (l1->val < l2->val) { head = l1; l1 = l1->next; } else { head = l2; l2 = l2->next; } node = head; while (l1 && l2) { if (l1->val < l2->val) { node->next = l1; l1 = l1->next; } else { node->next = l2; l2 = l2->next; } node = node->next; } if (l1) node->next = l1; else node->next = l2; return head; }};
阅读全文
0 0
- 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
- LeetCode 21 - Merge Two Sorted Lists
- MySQL 5.7主从复制
- Exams(二分求左界+贪心)
- 事件委托
- 大组合数取余模板
- Educational Codeforces Round 25
- LeetCode 21 Merge Two Sorted Lists
- AI将带我们去何方?(中-论述篇)
- ZOJ 1610 线段树
- OJ题目:雇佣兵
- css做正八边形
- 【MySQL】锁——查看当前数据库锁请求的三种方法
- js 鼠标单击多行文本框时怎样将光标定在文本框最前面
- Angular 2 HostListener & HostBinding
- sphinx增量索引和主索引来实现索引的实时更新