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.

Subscribe to see which companies asked this questiona

方法1

/** * 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* temp=new ListNode(0);        ListNode* result;        result=temp;        while(l1&&l2)        {            if(l1->val >l2->val)            {                temp->next=l2;                l2=l2->next;            }            else            {                temp->next=l1;                l1=l1->next;            }            temp=temp->next;        }    temp->next=l1?l1:l2;    return result->next;            }};