【LeetCode】-21- 合并两个有序链表

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

 

struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
{
	if (!l1)
		return l2;
	if (!l2)
		return l1;
	
	struct ListNode* head = NULL;
	struct ListNode* tail = NULL;
	while (l1 && l2)
	{
		//放l1
		if (l1->val < l2->val)
		{
			//若无元素
			if (head == NULL)
			{
				head = tail = l1;
			}
			else
			{
				tail->next = l1;
				tail = l1;
			}
			l1 = l1->next;
		}
		//放l2
		else
		{
			//若无元素
			if (head == NULL)
			{
				head = tail = l2;
			}
			else
			{
				tail->next = l2;
				tail = l2;
			}
			l2 = l2->next;
		}
	}
	//
	//此时l1和l2有一个放完了 tail直接连没放完的链表
	if (l1)
		tail->next = l1;
	if (l2)
		tail->next = l2;
	return head;
}

//方法2
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
{
	//如果其中一个链表为空，返回另一个
	if (l1 == NULL)
		return l2;
	if (l2 == NULL)
		return l1;
	struct ListNode* head = NULL;
	struct ListNode* tail = NULL;

	//先取一个小的做头
	if (l1->val < l2->val)
	{
		head = tail = l1;
		l1 = l1->next;
	}
	else
	{
		head = tail = l2;
		l2 = l2->next;
	}

	while (l1 && l2)
	{
		if (l1->val < l2->val)
		{
			tail->next = l1;
			l1 = l1->next;
			tail = tail->next;
		}
		else
		{
			tail->next = l2;
			l2 = l2->next;
			tail = tail->next;
		}
	}

	if (l1)
		tail->next = l1;
	if (l2)
		tail->next = l2;
	return head;
}

//方法3 哨兵位
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2)
{
	if (l1 == NULL)
		return l2;
	if (l2 == NULL)
		return l1;

	struct ListNode* tail = NULL;
	struct ListNode* head = NULL;
	//哨兵位
	head=tail= (struct ListNode*)malloc(sizeof(struct ListNode));

	while (l1 && l2)
	{
		if (l1->val < l2->val)
		{
			tail->next = l1;
			l1 = l1->next;
			tail = tail->next;
		}
		else
		{
			tail->next = l2;
			l2 = l2->next;
			tail = tail->next;
		}
	}

	if (l1)
		tail->next = l1;
	if (l2)
		tail->next = l2;

	struct ListNode* tmp = head->next;
	//释放哨兵位
	free(head);
	return tmp;
}