(C语言编写)PTA-7-2 在有序链表中插入数据 (20 分)

题目:
给定一批严格递增排列的整型数据，给定一个x，若x不存在，则插入x，要求插入后保持有序。存在则无需任何操作。

输入格式:
输入有两行： 第一个数是n值，表示链表中有n个数据。后面有n个数，分别代表n个数据。 第二行是要插入的数。

输出格式:
输出插入后的链表数据，以空格分开。行末不能有多余的空格。

输入样例1:
在这里给出一组输入。例如：

5 1 3 6 9 11
4
输出样例1:
在这里给出相应的输出。例如：

1 3 4 6 9 11

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
//结点框架
typedef int Data;
typedef struct _Node
{
	struct _Node* next;
	Data data;
}Node;
//创建链表
Node* createList()
{
	Node* headNode = (Node*)malloc(sizeof(Node));
	headNode->next = NULL;
	headNode->data = -1;
	return headNode;
}
//创建结点
Node* createNode(Data data)
{
	Node* newNode = (Node*)malloc(sizeof(Node));
	newNode->next = NULL;
	newNode->data = data;
	return newNode;
}
//头插
void insertByHead(Node* headNode, Data data)
{
	Node* newNode = createNode(data);
	if (newNode == NULL)
	{
		return;
	}
	newNode->next = headNode->next;
	headNode->next = newNode;

}
void List(Node* list, int a[], int n)
{
	Node* r = list;
	Node* s = NULL;
	for (int i = 0; i < n; i++)
	{
		s = createList();
		s->data = a[i];
		r->next = s;
		r = s;
	}
	r->next = NULL;
}
//打印
void insertByHead1(Node* headNode, Data data)
{
	Node* newNode = createNode(data);
	newNode->data = data;
	Node* p = headNode;
	Node* s = headNode->next;
	if (p->next == NULL)
	{
		newNode->next = NULL;
		p->next = newNode;
		p = newNode;
		return;
	}
	while (s->data < newNode->data && s->next != NULL)
	{
		p = p->next;
		s = s->next;
	}
	if (s->data == newNode->data)
	{
		free(newNode);
		return;
	}
	if (s->data > newNode->data)
	{
		newNode->next = p->next;
		p->next = newNode;
		return;
	}
	if (s->next == NULL)
	{
		s->next = newNode;
		newNode->next = NULL;
		return;
	}

}
void print(Node* headNode)
{
	Node* pMove = headNode->next;
	int count = 0;
	while (pMove)
	{
		if (count != 0)
		printf(" ");
		printf("%d", pMove->data);
		pMove = pMove->next;
		count++;
	}
}
int main()
{
	Node* list = createList();
	int a[100];
	int n, data1;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &a[i]);
	}
	List(list, a, n);
	scanf("%d", &data1);
	insertByHead1(list, data1);
	print(list);
	return 0;
}