[leetcode Merge Two Sorted Lists]week 15
来源:互联网 发布:黄金利多利空数据软件 编辑:程序博客网 时间:2024/05/16 05:37
一、题目
Merge two sorted linked lists and return itas a new list. The new list should be made by splicing together the nodes ofthe first two lists.
二、代码
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* head=new ListNode(0);
ListNode*p=head;
while(l1!=NULL || l2!=NULL)
{
if(l1==NULL)
{
p->next=l2;
l2=l2->next;
}
elseif (l2==NULL)
{
p->next=l1;
l1=l1->next;
}
else
{
if(l1->val < l2->val)
{
p->next=l1;
l1=l1->next;
}
else
{
p->next=l2;
l2=l2->next;
}
}
p=p->next;
}
returnhead->next;
}
};
三、思路
两个链表两个指针的val比对将新链表指针指向较小的节点。
- [leetcode Merge Two Sorted Lists]week 15
- 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
- 80端口被占用 PID 4
- [leetcode 55. Jump Game]week 7
- [leetcode 50. Pow(x, n)]week 11
- [leetcode 19 Remove Nth Node From End of List]week 13
- 两类strling数
- [leetcode Merge Two Sorted Lists]week 15
- [leetcode Search Insert Position]week 17
- Linux(redhat6.5)下 安装mysql5.7.18——yum方式
- [leetcode Best Time to Buy and Sell Stock]week 18
- [leetcode Maximum Subarray]week 19
- 线性表(List)---顺序存储结构
- [算法概论 8.12 k-生成树问题]
- zoj 2271
- 3625 Examining the Rooms(第一类strling数)