每日一练之合并两个有序链表

题目描述：

方法：双指针

代码实例：

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
struct ListNode
{
	int val;
	struct ListNode* next;
};
typedef struct ListNode ListNode;
struct ListNode* mergeTwoLists(struct ListNode* list1, ListNode* list2)
{
	if (list1 == NULL)
	{
		return list2;
	}
	if (list2 == NULL)
	{
		return list1;
	}
	ListNode* newHead, * newTail;
	//创建空链表
	newHead = newTail = (ListNode*)malloc(sizeof(ListNode));
	ListNode* l1 = list1;
	ListNode* l2 = list2;
	while (l1 && l2)
	{
		if (l1->val < l2->val)//谁小往后插
		{
			newTail->next = l1;
			newTail = newTail->next;
			l1 = l1->next;
		}
		else
		{
			newTail->next = l2;
			newTail = newTail->next;
			l2 = l2->next;
		}
	}
	if (l1)
	{
		newTail->next = l1;
	}
	if (l2)
	{
		newTail->next = l2;
	}
	ListNode* ret = newHead->next;
	free(newHead);
	newHead = newTail = NULL;
	return ret;
}

接下来是我自己写的代码！

代码时间复杂度较高不建议模仿仅仅提供思路！

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
 typedef struct ListNode ListNode;
struct ListNode* mergeTwoLists(struct ListNode* list1, struct ListNode* list2) {
    if(list1==NULL)
    {
        return list2;
    }
    if(list2==NULL)
    {
        return list1;
    }
    ListNode* list1tail=list1;
    while(list1tail->next)
    {
        list1tail=list1tail->next;
    }
    list1tail->next=list2;
    ListNode* fast=list1;
    ListNode* slow=list1;
    int arr[100]={0};
    int i=0;
    while(fast)//把链表存储的val值放进数组
    {
        arr[i++]=fast->val;
        fast=fast->next;
    }
    for(int j=0;j<i;j++)//用冒泡排序进行升序
    {
        for(int k=0;k<i-1;k++)
        {
            if(arr[k]>arr[k+1])
            {
                int temp=arr[k];
                arr[k]=arr[k+1];
                arr[k+1]=temp;
            }
        }
    }
    int k=0;
    while(slow)//把数组的数据放回去
    {
        slow->val=arr[k++];
        slow=slow->next;
    }
    return list1;
}

完！！