剑指Offer25-合并两个排序的链表-数据结构-双指针

原题链接

代码如下：

/**
 * 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) {
        auto dummy = new ListNode(-1), cur = dummy;
        while(l1 && l2){
            if(l1 -> val < l2 -> val){
                cur = cur -> next = l1;
                l1 = l1 -> next;
            }
            else{
                cur = cur -> next = l2;
                l2 = l2 -> next;
            }
        }
        if(l1)  cur -> next = l1;
        if(l2)  cur -> next = l2;

        return dummy -> next;
    }
};