leetcode21
来源:互联网 发布:cygwin linux 编辑:程序博客网 时间:2024/04/29 22:06
1、Merge Two Sorted Lists
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.
/** * 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 dummy(INT_MIN); ListNode* temp=&dummy; while(l1&&l2){ if(l1->val<l2->val){ temp->next=l1; l1=l1->next; } else{ temp->next=l2; l2=l2->next; } temp=temp->next; } temp->next = l1 ? l1 : l2; return dummy.next; }};
既然是sorted list,则不用担心每个list的顺序了,只需要不停的比较两个list对应的val的大小。最初设一个无穷小的节点,选择与第一个元素较小的list相连,分别指向他们的next,temp指向的节点继续担任最小节点的角色,选择下一对中较小的节点,直到有一方为空,则选择剩余一个节点作为temp的next.
0 0
- leetcode21
- leetcode21
- leetcode21: Integer to Roman
- LeetCode21: Generate Parentheses
- Leetcode21: Min Stack
- leetcode21.MergeTwoSorted Lists
- [LeetCode21]Merge Two Sorted Lists
- leetcode21 Merge Two Sorted Lists
- LeetCode21:Merge Two Sorted Lists
- leetcode21. Merge Two Sorted Lists
- LeetCode21. Merge Two Sorted Lists
- Leetcode21: Merge Two Sorted Lists
- leetcode21:Merge Two Sorted Lists
- leetcode21~Merge Two Sorted Lists
- leetcode21. Merge Two Sorted Lists
- LeetCode21. Merge Two Sorted Lists
- LeetCode21. Merge Two Sorted Lists
- LeetCode21:Merge Two Sorted Lists
- 粒子特效
- SpringMVC整合Redis Cluster集群(带密码)
- 2017.1.12【初中部 】普及组模拟赛C组 简单游戏 题解
- 深度学习在计算机视觉中应用综述
- 结构体成员变量偏移量的三种解法以及 用宏对成员变量进行修改
- leetcode21
- 排序
- bfs入门
- Zeppelin介绍与入门实践
- typedef vs define
- OpenWRT(四)AP、STA、中继模式
- IDEA工具使用
- github常见操作和常见错误!错误提示fatal: remote origin already exists.
- ZCMU-1441-Parliament