LeetCode 单链表合并 C++

两个单链表进行合并

注意点：

1. 判断空链表的状态
2. 小的数往前插入，大的数找到合适位置插入
3. 单链表没有向前的指针，只能找到合适位置后重新遍历

/**
 * 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 == nullptr) {
            return l2;
        }
        while (l2 != nullptr) {
            if (l2->val <= l1->val) {
                ListNode* tmp = l2;
                l2 = l2->next;
                tmp->next = l1;
                l1 = tmp;
            }
            else {
                ListNode* tmp = l2;
                l2 = l2->next;
                ListNode* pos = l1;
                int posCount = 0;
                while(pos->val <= tmp->val && pos->next!=nullptr) {
                    pos = pos->next;
                    posCount ++;
                }
                if (pos->val <= tmp->val && pos->next == nullptr) {
                    pos->next = tmp;
                    tmp->next = nullptr;
                } else {
                    posCount --;
                    pos = l1;
                    for (int i = 0; i < posCount; i++) {
                        pos = pos->next;
                    }
                    tmp->next = pos->next;
                    pos->next = tmp;
                }
            }
        }
        return l1;
    }
};