Merge Two Sorted Lists 合并排序列表

最新推荐文章于 2024-02-04 15:23:14 发布

码农少年

最新推荐文章于 2024-02-04 15:23:14 发布

阅读量157

点赞数

分类专栏： LeetCode之旅

本文链接：https://blog.csdn.net/wangbao2111/article/details/50164651

版权

LeetCode之旅专栏收录该内容

65 篇文章 0 订阅

订阅专栏

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)
            return l2;
        if(l2 == NULL)
            return l1;
        
        ListNode* head;
        ListNode* temp1;
        ListNode* temp2;
        
        if(l1->val < l2->val){
            head = l1;
            temp1 = l1->next;
            temp2 = l2;
        }else{
            head =l2;
            temp1 = l1;
            temp2 = l2->next;
        }
        ListNode* temp = head;
        
        while(temp1 != NULL && temp2 != NULL){
            if(temp1->val < temp2->val){
                temp->next = temp1;
                temp = temp1;
                temp1 = temp1->next;
            }else{
                temp->next = temp2;
                temp = temp2;
                temp2 = temp2->next;
            }
        }
        if(temp1 != NULL){
            temp->next = temp1;
        }
        if(temp2 != NULL){
            temp->next = temp2;
        }
        return head;
    }
};