leetcode-21-Merge Two Sorted Lists

问题

题目：[leetcode-21]

思路

可以不用开辟额外空间的办法。当然，只限于单链表的情形。

代码

/**
 * 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 && !l2) return NULL;
        if(l1 && !l2) return l1;
        if( !l1 && l2 ) return l2;


        ListNode* ret = NULL;
        ListNode* r = ret;

        int cnt = 0;
        while( l1&&l2 ){
            if(l1->val < l2->val){
                if(!ret){
                    ret = l1;
                    r = ret;
                }
                else{
                    r->next = l1;
                    r = l1;
                }
                l1 = l1->next;

            }
            else{
                if(!ret){
                    ret = l2;
                    r = ret;
                    std::cout << r->val << std::endl;
                }
                else{
                    r->next = l2;
                    r = l2;
                }
                l2 = l2->next;
            }
        }
        if(l1){
            r->next = l1;
        }
        if(l2){
            r->next = l2;
        }
        return ret;
    }
};