本渣渣又来刷题了
题目地址:https://leetcode-cn.com/problems/merge-two-sorted-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) {
ListNode* res = new ListNode(0); // dumb
ListNode* cur = res;
while (l1 != NULL && l2 != NULL) {
int val;
if (l1->val < l2->val) {
val = l1->val;
l1 = l1->next;
} else {
val = l2->val;
l2 = l2->next;
}
cur->next = new ListNode(val);
cur = cur->next;
}
if (l1 == NULL) {
cur->next = l2;
}
if (l2 == NULL) {
cur->next = l1;
}
return res->next;
}
};
解法二:递归,很巧妙,看题解看到的,自己实现了一遍
/**
* 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;
}
if (l1->val < l2->val) {
l1->next = mergeTwoLists(l1->next, l2);
return l1;
} else {
l2->next = mergeTwoLists(l2->next, l1);
return l2;
}
}
};