【LeetCode】21. 合并两个有序链表

逻辑比较简单， 但是感觉对链表的掌握程度不够，需要重新学习一遍链表的基本操作。

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode* HeadNode = new ListNode(0);
        ListNode* MergeNode = HeadNode;
        while((l1 != NULL)&&(l2 != NULL))
        {
            if(l1->val >= l2->val)
            {
                MergeNode->next = l2;
                l2 = l2->next;
            }
            else
            {
                MergeNode->next = l1;
                l1 = l1->next;
            }
            MergeNode = MergeNode->next;
        }
        while(l1 != NULL)
        {
            MergeNode->next = l1;
            l1 = l1->next;
            MergeNode = MergeNode->next;
        }
        while(l2 != NULL)
        {
            MergeNode->next = l2;
            l2 = l2->next;
            MergeNode = MergeNode->next;
        }
        return HeadNode->next;
    }
};