算法题——合并两个有序链表

题目是各大厂的面试题，代码是自己写的 

因为是两个有序链表，虽然有用了循环嵌套，但实际时间复杂度是O(n)

/**
 * 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 *l1_head = l1;
        ListNode *l2_head = l2;
        ListNode *node1 = l1;
        ListNode *node2 = l2;
        ListNode *node2_pre = NULL;
        int i = 0;
        if (l2 == NULL){
            return l1;
        }
        while(NULL != l1_head){
            if ((node2 == NULL) && (l1_head != NULL)){
                node2 = node2_pre;
            }
            while(NULL != node2){
                //printf("%d\n", ++i);
                if (l1_head->val == node2->val)
                {
                    node1 = l1_head;
                    l1_head = l1_head->next;
                    node1->next = node2->next;
                    node2->next = node1;
                    node2_pre = node1;
                    node2 = node1->next;
                    break;
                }
                else if (l1_head->val < node2->val){
                    node1 = l1_head;
                    l1_head = l1_head->next;
                    if (node2_pre == NULL){
                        node1->next = l2_head;
                        l2_head = node1;
                        node2_pre = l2_head;
                    }else{
                        node2_pre->next = node1;
                        node1->next = node2;
                        node2_pre = node1;                        
                    }
                    
                    break;
                }
                else{
                    if (NULL== node2->next){
                        node1 = l1_head;
                        l1_head = l1_head->next;
                        node1->next = node2->next;
                        node2->next = node1;
                        node2_pre = node1;
                        node2 = node1->next;
                    }else{
                        node2_pre = node2;
                        node2 = node2->next;
                    }
                    if ((node2 == NULL) && (l1_head != NULL)){
                        node2 = node2_pre;
                    }
                    continue;
                }
            }
        }

        return l2_head;
        
    }
};