【leetcode】10 mergetwosorted list
2015-05-11 14:38
267 查看
合并两个有序链表
常见的题目
/**
* 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) {
if(l1==NULL)
return l2;
else if(l2==NULL)
return l1;
ListNode* mergeList=NULL;
if(l1->val>l2->val){
mergeList=l2;//
mergeList->next=mergeTwoLists(l2->next, l1);
}else{
mergeList=l1;//
mergeList->next=mergeTwoLists(l1->next, l2);
}
return mergeList;
}
};
常见的题目
/**
* 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) {
if(l1==NULL)
return l2;
else if(l2==NULL)
return l1;
ListNode* mergeList=NULL;
if(l1->val>l2->val){
mergeList=l2;//
mergeList->next=mergeTwoLists(l2->next, l1);
}else{
mergeList=l1;//
mergeList->next=mergeTwoLists(l1->next, l2);
}
return mergeList;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode]Sort List 链表排序 + Merge Two Sorted List 合并两个有序链表
- leetcode merge two sorted list
- [LeetCode]Merge Two Sorted Lists & Remove Duplicates from Sorted List 两个有序链表合并为一个&删除链表重复元素
- 【LeetCode】【Linked List】Merge Two Sorted Lists
- leetcode 21:Merge Two Sorted Lists(15-10-9)
- leetcode MergeTwoSortedList
- Merge K Sorted List（含Merge Two Sorted LIst） leetcode java
- LeetCode -- Merge Two Sorted Linked List
- LeetCode@LinkedList_21_Merge_Two_Sorted_Lists
- LeetCode 刷题： 合并两个有序链表 (merge two sorted list)
- leetCode(8):merge two sorted list
- Merge Two Sorted List ---LeetCode
- LeetCode 学习 LinkedList 专项（4）—— Merge Two Sorted Lists
- LeetCode_Linked List_Merge Two Sorted Lists
- Merge Sorted Array leetcode java（回顾MergeTwoArray和MergeTwoLinkedList）
- [leetcode][list] Merge Two Sorted Lists
- 【leetcode】 merge two sorted list
- Leetcode练习－ Merge Two Sorted List
- LeetCode—Merge Two Sorted Lists融合两个有序单链表
- LeetCode 21 Merge Two Sorted Lists（合并两个已排序的链表）（Linked List）