C语言链表

题目：编写一个函数将一个线性表L（有r个元素且任何元素均不为0）分拆成两个线性表，使L中大于0的元素存放在A中，小于0的元素存放在B中,且A、B两个线性表均为有序序列。

#include<stdio.h>
#include<malloc.h>
#include<assert.h>
#include "stdlib.h"
typedef int Elemtype;
typedef struct seqList
{
	Elemtype data;
	struct seqList* Next;
}seqList,*PNode;
typedef struct List
{
	PNode first;
	PNode last;
	size_t size;
}List;
 // 初始化链表
void InitList(List* list)
{
	list->first = list->last = (seqList*)malloc(sizeof(seqList));
	assert(list->first != NULL);
	list->first->Next = NULL;
	list->size = 0;
}
// 在链表尾部放入数据
void push_back(List* list,Elemtype num)
{
	seqList* s = (seqList*)malloc(sizeof(seqList));
	assert(s != NULL);
	s->data = num;
	seqList* p = list->first;
	while (p->Next != NULL)
	{
		p = p->Next;
	}
	p->Next = s;
	list->last = s;
	s->Next = NULL;
	list->size++;
}
// 显示链表
void show_list(List* list)
{
	seqList* p = list->first->Next;
	while (p != NULL)
	{
		printf(" %d -> ",p->data);
		p = p->Next;
	}
	printf("\n");
}
// 对链表排序（从小到大）
void sort(List* list)
{
	seqList* s = list->first->Next;
	list->last = s;
	seqList* q = s->Next;
	list->last->Next = NULL;
	while (q != NULL)
	{
		s = q;
		q = q->Next;
		seqList* p = list->first;
		while (p->Next != NULL && p->Next->data< s->data)
		{
			p = p->Next;
		}
		if (p->Next == NULL)
		{
			list->last = s;
		}
		s->Next = p->Next;
		p->Next = s;
	}
}
// 生成A,B链表
void divAB(List* list,List* listA,List* listB)
{
	seqList* p = list->first->Next;
	while (p != NULL)
	{
		if (p->data > 0)
		{
			push_back(listA,p->data);
		}
		else
		{
			push_back(listB,p->data);
		}
		p = p->Next;
	}
}
int main()
{
	Elemtype num;
	List mylist;
	List mylistA;
	List mylistB;
	InitList(&mylist);
	InitList(&mylistA);
	InitList(&mylistB);
	printf("请输入要插入的元素（0为结束标志）：");
	while (scanf_s("%d",&num),num != 0)
	{
		push_back(&mylist,num);
	}
	printf("链表mylist为：");
	show_list(&mylist); // 显示链表mylist
	sort(&mylist);
	printf("排序后的链表mylist为：");
	show_list(&mylist);
	divAB(&mylist, &mylistA, &mylistB);
	printf("链表A为：\n");
	show_list(&mylistA);
	printf("链表B为：\n");
	show_list(&mylistB);
	system("pause");
	return 0;
}