LeetCode-21-合并两个有序链表-C语言

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode head;
    head.next = NULL;
    struct ListNode *rear = &head;
    struct ListNode *node = NULL;
    
    while(l1 && l2){
        rear->next = l1->val < l2->val ? l1 : l2; 
        
        if(l1->val < l2->val){
            l1 = l1->next;
        }else{
            l2 = l2->next;
        }
            
        rear = rear->next;
    }
    
    if(l1){
        rear->next = l1;
        
    }
    if(l2){
        rear->next = l2;
    }
    
    
    return head.next;
    
}