题目链接:LC 21. 合并两个有序链表
2020.10.10第一次解答:
解题思路
顺序遍历,菜鸡解法。
哪个小就把哪个接到当前指针的next指针上,直到某个链表遍历完毕,并将另一个链表整个接到当前指针的next指针。
/**
* Definition for singly-linked list.
* 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* l1, ListNode* l2) {
if (!l1) return l2;
else if (!l2) return l1;
ListNode *head, *cur;
if (l1->val <= l2->val) {
head = l1;
l1 = l1->next;
}
else {
head = l2;
l2 = l2->next;
}
cur = head;
while (l1 && l2) {
if (l1->val <= l2->val) {
cur->next = l1;
l1 = l1->next;
}
else {
cur->next = l2;
l2 = l2->next;
}
cur = cur->next;
}
if (!l1) {
cur->next = l2;
}
else {
cur->next = l1;
}
return head;
}
};