王道OJ中级-day4作业

输入3 4 5 6 7 9999一串整数，9999代表结束，通过头插法新建链表，并输出，通过尾插法新建链表并输出。

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#define Maxsize 50


typedef struct LNode {
	int data;
	struct LNode* next;
}LNode,*LinkList;

//头插法
LinkList cratelink1(LinkList& L)
{
	L = (LinkList)malloc(sizeof(LNode));
	L->next = NULL;
	LinkList S;
	int x;
	scanf("%d", &x);
	while (x != 9999)
	{
		S= (LinkList)malloc(sizeof(LNode));
		S->data = x;
		S->next = L->next;
		L->next = S;
		scanf("%d", &x);
	}
	return L;
	
}

//尾插法
LinkList crateLink2(LinkList& L)
{
	L = (LinkList)malloc(sizeof(LNode));
	LinkList S, R = L;
	int x;
	scanf("%d", &x);
	while (x != 9999)
	{
		S = (LinkList)malloc(sizeof(LNode));
		S->data = x;
		S->next = R->next;
		R->next = S;
		R = S;
		scanf("%d", &x);
	}
	R->next = NULL;
	return L;
}


//打印链表
void print(LinkList L)

{

	L = L->next;

	while (L != NULL)

	{

		printf("%d", L->data);//打印当前结点数据

		L = L->next;//指向下一个结点

		if (L != NULL)

		{

			printf(" ");

		}

	}

	printf("\n");

}


int main()
{
	LinkList L;
	cratelink1(L);
	print(L);
	crateLink2(L);
	print(L);

}