Merge Two Sorted Lists 合并链表

来源：互联网发布：zip文件密码破解 mac 编辑：程序博客网时间：2024/04/29 05:48

Merge Two Sorted Lists

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

0 0