首页 > 其他 > 详细

Leetcode 21. Merge Two Sorted Lists(easy)

时间:2017-11-17 23:57:46      阅读:393      评论:0      收藏:0      [点我收藏+]

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) {
     if (l1 == NULL){
         return l2;
     }
     if (l2 == NULL){
        return l1;
     }
        
     if (l1 -> val <= l2 -> val){
         l1 -> next = mergeTwoLists(l1 -> next, l2);
         return l1;
     }
     else{
         l2 -> next = mergeTwoLists(l1, l2 -> next);
         return l2;
     }
        
    }
};

 

Leetcode 21. Merge Two Sorted Lists(easy)

原文:http://www.cnblogs.com/simplepaul/p/7854242.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!