10.5作业

//main.c

#include "head.h"
int main(int argc, const char *argv[])
{
	Linklist L=NULL;
	char str[10];
	int element;
	do
	{
		printf("请输入插入的element:");
		scanf("%d",&element);
		L=insert_head(L,element);
		printf("您要继续吗？yes/no:");
		scanf("%s",str);	
	}while(strcmp(str,"no"));
	stack_link_output(L);
	do
	{
		L=delete_head(L);
		printf("您要继续吗？yes/no:");
		scanf("%s",str);		
	}while(strcmp(str,"no"));
	stack_link_output(L);
	return 0;
}
 





//test.c



#include "head.h"
Linklist create_node()
{
	Linklist s=(Linklist)malloc(sizeof(struct Node));
	if(NULL ==s)
	{
		return NULL;
	}
	s->data=0;
	s->next=NULL;
	return s;
}
 
Linklist insert_head(Linklist L,int element)
{
	Linklist s=create_node();
	if( NULL == L)
		{
		s->data=element;
		L=s;
	}
	else
	{
		s->next=L->next;
		L->next=s;
		s->data=L->data;
		L->data=element;
	}
	return L;
}
 
void stack_link_output(Linklist L)
{
	if(NULL ==L)
	{
		puts("ERROR");
		return;
	}
	Linklist p=L;
	while(p!=NULL)
	{
		printf("%d\t",p->data);
		p=p->next;
	}
	puts("");
}
 
Linklist delete_head(Linklist L)
{
	if(NULL ==L)
	{
		puts("empty");
		return NULL;
	}
	else if(NULL == L->next)
	{
		printf("出栈的元素是：%d\n",L->data);
		free(L);L=NULL;
	}
	else
	{
		Linklist q=L->next;
		printf("出栈的元素是：%d\n",L->data);
		L->data=q->data;
		L->next=q->next;
		free(q);
		q=NULL;
	}
	return L;
}
 

//head.h


#ifndef __HEAD_H__
#define __HEAD_H__
#include 
#include 
#include 
typedef struct Node
{
	int data;
	struct Node *next;
}*Linklist;
Linklist create_node();
Linklist insert_head(Linklist L,int element);
void stack_link_output(Linklist L);
Linklist delete_head(Linklist L);
#endif