数据结构day5

link_stack.c

#include "link_stack.h"
//申请栈顶指针
top_p create_top()
{
	top_p top = (top_p)malloc(sizeof(top_t));
	if(top==NULL)
	{
		printf("空间申请失败\n");
		return NULL;
	}
	top->len = 0;
	top->ptop = NULL;  //刚申请栈指针时没有指向元素
	return top;
}
//申请结点的函数
link_p create_node(int data)
{
	link_p new = (link_p)malloc(sizeof(link_stack));
	if(new==NULL)
	{
		printf("申请空间失败\n");
		return NULL;
	}
	new->data = data;
	return new;
}
//入栈/压栈
void push_stack(top_p T,int data)
{
	if(T==NULL)
	{
		printf("入参为空\n");
		return;
	}
	link_p new = create_node(data);
	//入栈
	new->next = T->ptop;
	T->ptop = new;
	T->len++;
}
//判空
int empty(top_p T)
{
	if(T==NULL)
	{
		printf("入参为空\n");
		return -1;
	}
	return T->ptop==NULL?1:0;
}
//出栈/弹栈
void pop_stack(top_p T)
{
	if(T==NULL)
	{
		printf("入参为空\n");
		return;
	}
	if(empty(T))
	{
		printf("栈为空，无需出栈");
		return;
	}
	link_p del=T->ptop;
	T->ptop=del->next;
	free(del);
	T->len--;
}
//遍历
void show_stack(top_p T)
{
    if(T==NULL)
	{
		printf("入参为空\n");
		return;
	}
	if(empty(T))
	{
		printf("栈为空，不能遍历");
		return;
	}
	link_p p=T->ptop;
	while(p!=NULL)
	{
		printf("%d->",p->data);
		p=p->next;
	}
	printf("NULL");
	putchar(10);
}
//销毁
void free_stack(top_p T)
{
if(T==NULL)
	{
		printf("入参为空\n");
		return;
	}
	link_p p=T->ptop;
	while(p!=NULL)
	{
		p=p->next;
		free(p);
	}


}

link_stack.h

#ifndef __LINK_STACK_H__
#define __LINK_STACK_H__
#include <stdio.h>
#include <stdlib.h>   
typedef struct link_stack
{
	int data;	
	struct link_stack *next;  
}link_stack,*link_p;
typedef struct top_t
{
	int len;
	link_p ptop;
}top_t,*top_p;
top_p create_top();
link_p create_node(int data);
void push_stack(top_p T,int data);
int empty(top_p T);
void pop_stack(top_p T);
void show_stack(top_p T);
void free_stack(top_p T);


#endif

main.c

#include "link_stack.h"
int main()
{
	top_p T =create_top();
	push_stack(T,1);
	push_stack(T,2);
	push_stack(T,3);
	push_stack(T,4);
    show_stack(T);

	return 0;
}