21 合并两个有序链表
迭代法
//自己写的垃圾代码(迭代法)
struct ListNode {
int val;
ListNode *next;
ListNode() : val(0), next(nullptr) {}
ListNode(int x) : val(x), next(nullptr) {}
ListNode(int x, ListNode *next) : val(x), next(next) {}
};
class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
ListNode* l1 = list1;
ListNode* l2 = list2;
ListNode* head = nullptr;
ListNode* p = nullptr;
if (l1 == nullptr && l2)
{
return l2;
}
if (l2 == nullptr && l1)
{
return l1;
}
if (l1 == nullptr && l2 == nullptr)
{
return head;
}
while (l1 && l2)
{
if (l1->val < l2->val)
{
if (head == nullptr)
{
head = new ListNode(l1->val, nullptr);
p = head;
}
else
{
p->next = new ListNode(l1->val, nullptr);
p = p->next;
}
l1 = l1->next;
}
else
{
if (head == nullptr)
{
head = new ListNode(l2->val, nullptr);
p = head;
}
else
{
p->next = new ListNode(l2->val, nullptr);
p = p->next;
}
l2 = l2->next;
}
}
if (l1 == nullptr && l2)
{
p->next = l2;
}
if (l2 == nullptr && l1)
{
p->next = l1;
}
return head;
}
};
代码冗余修改:
class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
ListNode* l1 = list1;
ListNode* l2 = list2;
ListNode* head = nullptr;
ListNode* p = nullptr;
if (l1 == nullptr)
{
return l2;
}
if (l2 == nullptr)
{
return l1;
}
while (l1 && l2)
{
if (l1->val < l2->val)
{
if (head == nullptr)
{
head = new ListNode(l1->val, nullptr);
p = head;
}
else
{
p->next = new ListNode(l1->val, nullptr);
p = p->next;
}
l1 = l1->next;
}
else
{
if (head == nullptr)
{
head = new ListNode(l2->val, nullptr);
p = head;
}
else
{
p->next = new ListNode(l2->val, nullptr);
p = p->next;
}
l2 = l2->next;
}
}
if (l1 == nullptr)
{
p->next = l2;
}
else
{
p->next = l1;
}
return head;
}
};
看了下,官方的迭代法,链表设了头节点,我的没有。
递归法
!!!!
class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
if(list1==nullptr)
{
return list2;
}
if(list2==nullptr)
{
return list1;
}
if(list1->val<list2->val)
{
list1->next=mergeTwoLists(list1->next,list2);
return list1;
}
else
{
list2->next=mergeTwoLists(list1,list2->next);
return list2;
}
}
};