[LeetCode]Merge Two Sorted Lists
来源:互联网 发布:数据建模 开源 编辑:程序博客网 时间:2024/05/29 07:47
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.
这道题是让合并两个有序链表。增设一个头结点。下面贴上代码:
#include <iostream>using namespace std;struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {}};class Solution {public: ListNode* create(){ int num; cout << "请输入个数:"; cin >> num; ListNode* head = new ListNode(0); ListNode* first = head; for (int i = 0; i < num; i++){ int n; cin >> n; ListNode* newNode = new ListNode(n); head->next = newNode; head = newNode; } return first->next; } ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { ListNode* h1 = l1; ListNode* h2 = l2; ListNode* ans = new ListNode(0); ListNode* l3 = ans; while (h1&&h2){ if (h1->val <= h2->val){ ans->next = h1; ans = h1; h1 = h1->next; } else{ ans->next = h2; ans = h2; h2 = h2->next; } } ans->next = h1 ? h1 : h2; return l3->next; }};int main(){ Solution s; ListNode* l1 = s.create(); ListNode* l2 = s.create(); ListNode* l3 = s.mergeTwoLists(l1, l2); while (l3){ cout << l3->val << " "; l3 = l3->next; } cout << endl; return 0;}
附加了链表的建立以便测试。
0 0
- LeetCode: Merge Two Sorted Lists
- [Leetcode] Merge Two Sorted Lists
- Leetcode: Merge Two Sorted Lists
- [LeetCode] Merge Two Sorted Lists
- [Leetcode] Merge two sorted lists
- leetcode Merge Two Sorted Lists
- [LeetCode]Merge Two Sorted Lists
- [leetcode]Merge Two Sorted Lists
- LeetCode-Merge Two Sorted Lists
- [leetcode] Merge Two Sorted Lists
- [LeetCode] Merge Two Sorted Lists
- LeetCode - Merge Two Sorted Lists
- LeetCode:Merge Two Sorted Lists
- LeetCode | Merge Two Sorted Lists
- 【leetcode】Merge Two Sorted Lists
- Leetcode: Merge Two Sorted Lists
- 【LeetCode】Merge Two Sorted Lists
- Leetcode Merge Two Sorted Lists
- 5.0 MmsService
- The methods in the UIConstraintBasedLayoutDebugging category on UIView listed
- How to implement robust and scalable transactions across documents with MongoDB
- 【HDU2546】饭卡
- UVALive 3490 (LA 3940) || ZOJ 2619 Generator AC自动机(或KMP) + 整数高斯消元 + 数学期望
- [LeetCode]Merge Two Sorted Lists
- 判断一个数是否是质数的方法
- velocity模板判断null和空字符串方法
- 有关Tiled GPU perf. warning的研究
- Setting up Static IP Address - 12.04LTS
- IOS SDK详解之KVC
- 蓝桥杯 历届试题 分糖果 模拟
- 黑马程序员——集合框架1:体系框架
- Ubuntu14.10 编译 Android5.0 源码