merge two sorted lists
2015-03-08 18:20
218 查看
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.
合并后的序列仍然为有序的。从小到大。
建立一个新的链表来存放,先开辟一个头结点,头结点为空,头结点的下一个结点为存放的数(新链表的)
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 *p=new ListNode(0); ListNode *head=p; while(l1&&l2){ if(l1->val<l2->val){ p->next=l1; //将l1放进新链表中 l1=l1->next; //l1移动一个位置 p=p->next; //新链表移动一个位置 } else{ p->next=l2; l2=l2->next; p=p->next; } } if(l1)p->next=l1,p=p->next; //只有l1了,此时l2已经全部存入新链表中 if(l2)p->next=l2,p=p->next; return head->next; //返回头节点的下一个,即新链表的第一个结点。 } };
相关文章推荐
- Merge Two Sorted Lists LeetCode JavaScript
- [LeetCode] Merge Two Sorted Lists, Solution
- Merge Two Sorted Lists *****
- LeetCode 21. Merge Two Sorted Lists(合并两个有序单链表)
- Merge Two Sorted Lists
- 【LeetCode】Merge Two Sorted Lists
- Leetcode---21. Merge Two Sorted Lists
- LeetCode_Easy心得:21. Merge Two Sorted Lists(C语言)
- 6.2 Merge Two Sorted Lists
- LeetCode 21 - Merge Two Sorted Lists
- LeetCode: Merge Two Sorted Lists
- 6.2—排序—Merge Two Sorted Lists
- LeetCode 21. Merge Two Sorted Lists
- LeetCode OJ 之Merge TwoSorted Lists 解题报告
- LeetCode 之 Merge Two / k Sorted Lists — C/C++ 实现
- 【leetcode c++】21 Merge Two Sorted Lists
- Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- LeetCode 21. Merge Two Sorted Lists
- Leetcode c语言- Merge Two Sorted Lists