【LeetCode】合并两个有序链表

最新推荐文章于 2024-11-11 20:59:17 发布

trancybao

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量131

点赞数

分类专栏： C++ 算法文章标签： leetcode

本文链接：https://blog.csdn.net/trancybao/article/details/106151211

版权

算法同时被 2 个专栏收录

29 篇文章 0 订阅

订阅专栏

C++

21 篇文章 0 订阅

订阅专栏

方法一：穿线法

class Solution {
public:
	ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
		if (l1 == NULL) {
			return l2;
		}
		if (l2 == NULL) {
			return l1;
		}
		ListNode* p = l1;
		ListNode* q = l2;
		ListNode* head ;
		ListNode* tail ;
		if (l1->val <= l2->val) {
			head = l1;
			tail = l1;
			p = p->next;
		}
		else {
			head = l2;
			tail = l2;
			q = q->next;
		}
		while (p != NULL && q != NULL) {
			if (p->val <= q->val) {
				tail->next = p;
				tail = p;
				p = p->next;
			}
			else {
				tail->next = q;
				tail = q;
				q = q->next;
			}
		}
		if (p == NULL) {
			tail->next = q;
		}
		if (q == NULL) {
			tail->next = p;
		}
		return head;
	}
};

方法二：递归

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
       if (l1 == nullptr) {
            return l2;
        } else if (l2 == nullptr) {
            return l1;
        } else if (l1->val < l2->val) {
            l1->next = mergeTwoLists(l1->next, l2);
            return l1;
        } else {
            l2->next = mergeTwoLists(l1, l2->next);
            return l2;
        }
    }
};