leetcode21:合并两个排序链表

C++是不是一直内存100%
简单方法：

/**
 * 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* l1c = l1;
        ListNode* l2c = l2;
            while(l2c&&l1c)
            {
                if(l1c -> val <= l2c-> val)
                {
                    l1c -> next = l2c;
                    l2c = l2c-> next;
                }
                else
                {
                    l2c-> next = l1c;
                    l1c = l1c-> next;
                }
                p = p -> next;//关键一步，要注意p结构体指针的自增，否则就只有一个值了
            }
            l1c==NULL ? l2c->next = l2c:l1c->next=l1c

    }
};