Leetcode NO.21 Merge Two Sorted Lists
来源:互联网 发布:免费java教程入门视频 编辑:程序博客网 时间:2024/04/30 08:25
本题题目要求如下:
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.
这题的算法没有什么好讲的,纯粹是考基本功,就是用linkedlist实现mergesort中的merge这一步,
我第一次做的是用recursive,效果明显不如这次的iteritive
代码如下:
/** * 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* virtual_head = new ListNode(0); ListNode* temp = virtual_head; while (l1 != nullptr and l2 != nullptr) { ListNode* node; if (l1->val < l2->val) { node = l1; l1 = l1->next; } else { node = l2; l2 = l2->next; } temp->next = node; temp = temp->next; } if (l1 != nullptr) { temp->next = l1; } else if (l2 != nullptr) { temp->next= l2; } return virtual_head->next; }};
0 0
- Leetcode NO.21 Merge Two Sorted Lists
- LeetCode No.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[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
- Cobbler远程安装CentOS系统
- js常见操作
- Java关键字static、final使用小结
- Http协议详解
- android开发之Selector与Shape的应用
- Leetcode NO.21 Merge Two Sorted Lists
- 三角形
- 输出短句
- struts2简单的实例
- Android进阶篇 自定义ActionBar的设计理念
- Linux上Oracle 11g安装步骤
- java分布式事务(JTA)实现 jotm和atomikos
- 一个原生Ajax获取JSON格式数据的例子
- NSLog的注释及使用重定向;控制台内容写入文件