2.29 作业

#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
typedef struct link_list
{
	union
	{
		int data;
		int len;
	};
	struct link_list *next;
}link_list,*link_p;
link_p creat_head()
{
	link_p H=(link_p)malloc(sizeof(link_list));
	if(H==NULL)
	{
		printf("空间申请失败\n");
	}
	H->len=0;
	H->next==NULL;
	return H;
}
link_p creat_node(int data)
{
	link_p new=(link_p)malloc(sizeof(link_list));
	if(new==NULL)
	{
		printf("空间申请失败\n");
	}
	new->data=data;
	return new;
}

//尾插
void insert_tail(link_p H,int data)
{
	if(H==NULL)
	{
		printf("入参为空\n");
		return;
	}
	link_p p=H;
	while(p->next!=NULL)
	{
		p=p->next;
	}
	link_p new=creat_node(data);
	new->next=p->next;
	p->next=new;
	H->len++;
}
//输出
void out_link(link_p H)
{
	if(H==NULL)
	{
		if(H==NULL)
		{
			printf("入参为空\n");
			return;
		}
	}
	link_p p=H->next;
	while(p!=NULL)
	{
		printf("%d->",p->data);
		p=p->next;
	}
	printf("%s","NULL");
	putchar(10);
}
int main(int argc, const char *argv[])
{
	//已知链表头结点
	link_p A = creat_head();
	//接收链表头结点
	link_p B = creat_head();
	insert_tail(A,10);
	insert_tail(A,20);
	insert_tail(A,30);
	insert_tail(A,40);
	insert_tail(A,50);
	printf("链表A中的数据\n");
	out_link(A);
	FILE *wfn=fopen("./test.txt","w");
	link_p temp=A->next;
	while(temp!=NULL)
	{
		fprintf(wfn,"%c",temp->data);
		temp=temp->next;
	}
	fclose(wfn);
	FILE *rfn=fopen("./test.txt","r");
	char arr[]={0};
	int i=0;
	while(1)
	{
		int ret=fscanf(rfn,"%c",arr);
		if(ret!=1){break;}
		insert_tail(B,arr[i]);
	}
	printf("链表B中接收的数据\n");
	out_link(B);
	fclose(rfn);
	return 0;
}