leetcode week14

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) {
        ListNode * head = new ListNode(0);  
        ListNode * ptr = head;  
          
        while(l1 != NULL || l2 != NULL){  
            ListNode * cur = NULL;  
            if(l1 == NULL){  
                cur = l2;  
                l2 = l2->next;  
            }  
            else if(l2 == NULL){  
                cur = l1;  
                l1 = l1->next;  
            }  
            else{  
                if(l1->val < l2->val){  
                    cur = l1;  
                    l1 = l1->next;  
                }  
                else{  
                    cur = l2;  
                    l2 = l2->next;  
                }  
            }  
            ptr->next = cur;  
            ptr = ptr->next;  
        }  
          
        return head->next;  
    }
};