LeetCode 21. 合并两个有序链表(双指针，C++和python）

21. 合并两个有序链表

题目链接

这道题属于简单题，但是容易想复杂，实际上类似双指针。
如果l1.val<l2.val时，答案添加l1
如果l1.val>l2.val时，答案添加l2
C++循环:

/**
 * 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 == 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;
        }
    }
};

python循环：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        ans = ListNode()
        ans.next = l1
        ret = ans
        while l1 and l2:
            if l1.val <= l2.val:
                ans.next = l1
                l1 = l1.next
            else:
                ans.next = l2
                l2 = l2.next
            ans = ans.next
        if l1:
            ans.next = l1
        if l2:
            ans.next = l2
        return ret.next              

如果对你有帮助的话，请点个赞哦！