21. Merge Two Sorted Lists

来源:互联网 发布:java 实参 编辑:程序博客网 时间:2024/05/29 09:28

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 *dummy = new ListNode(0);        ListNode *tmp = dummy;        while (l1 != NULL && l2 != NULL)        {            if (l1->val < l2->val)            {                tmp->next = l1;                l1 = l1->next;            }            else            {                tmp->next = l2;                l2 = l2->next;            }            tmp = tmp->next;        }        if (l1 == NULL)tmp->next = l2;        if (l2 == NULL) tmp->next = l1;        return dummy->next;    }};
0 0
原创粉丝点击