leetcode合并两个已经排序的链表

21. 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 question

题目的大概意思就是将两个已经排序好的链表合并，、

代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
    if(l1==NULL) return l2;
    if(l2==NULL) return l1;
    struct ListNode *dummy=(struct ListNode*)malloc(sizeof(struct ListNode));
    dummy->next=NULL;
    struct ListNode *ptr=dummy;
    while(l1!=NULL&&l2!=NULL){
        if(l1->val<l2->val){
            ptr->next=l1;
            l1=l1->next;
        }else{
            ptr->next=l2;
            l2=l2->next;
        }
        ptr=ptr->next;
    }
    if(l1==NULL){
        ptr->next=l2;
    }
    else if(l2==NULL){
        ptr->next=l1;
    }
    ptr=dummy->next;
    free(dummy);
    return ptr;
    
}