Leetcode21. 合并两个有序链表

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2){
	struct ListNode* p3;
	struct ListNode* l3 = (struct ListNode*)malloc(sizeof(struct ListNode));
	if (l1 == NULL && l2 == NULL) {
		return NULL;
	}
	else if (l1 == NULL) {
		return l2;
	}
	else if (l2 == NULL){
		return l1;
	}
	else {
		if (l1->val <= l2->val) {
			l3 = l1;
			l1 = l1->next;
			l3->next = NULL;
			p3 = l3;
		}
		else {
			l3 = l2;
			l2 = l2->next;
			l3->next = NULL;
			p3 = l3;
		}
		while (l1 != NULL && l2 != NULL) {
			if (l1->val <= l2->val) {
				l3->next = l1;
				l1 = l1->next;
				l3 = l3->next;
				l3->next = NULL;
			}
			else {
				l3->next = l2;
				l2 = l2->next;
				l3 = l3->next;
				l3->next = NULL;
			}
		}
		if (l1 == NULL) {
			l3->next = l2;
		}
		else {
			l3->next = l1;
		}
		return p3;
	}
}