2024-02-26 作业

作业要求：

1. 整理链栈的代码
2. 复习前面的顺序栈和链表
3. 整理思维导图，有时间把前面函数也复习复习

1.整理链栈的代码

运行代码：

（1）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 free_stack(top_p *T)
{
	free(*T);
	*T==NULL;
}
//出栈/弹栈
void pop_stack(top_p T)
{
	if(T==NULL)
	{
		printf("入参为空\n");
		return;
	}
	printf("%d\n",T->ptop->data);
	link_p del=T->ptop;
	T->ptop=T->ptop->next;
	free(del);
	T->len--;
}
//遍历

void show_stack(top_p T)
{
	if(T==NULL)
	{
		printf("入参为空\n");
		return;
	}
	if(empty(T))
	{
		printf("空\n");
		return;
	}
	link_p p=T->ptop;
	while(p!=NULL){
		printf("%d ",p->data);
		p=p->next;
	}
	putchar(10);
}
void free_t(top_p *T)
{ 
	if(T==NULL)
	{
		printf("入参为空\n");
		return;
	}
	link_p p=(*T)->ptop;
	link_p del=(*T)->ptop;
	do{
		del=p;
		p=p->next;
		free(del);
	}while(p->next!=NULL);
	*T=NULL;


}

（2）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 free_t(top_p *T);
void pop_stack(top_p T);
void show_stack(top_p T);
#endif

（3）main.c 

#include "link_stack.h"
int main()
{
	top_p T=create_top();
	push_stack(T,5);
	push_stack(T,4);
	push_stack(T,3);
	push_stack(T,2);
	push_stack(T,1);
	pop_stack(T);
	show_stack(T);
	free_t(&T);
	return 0;
}

运行截图：

2. 复习前面的顺序栈和链表

3.整理思维导图，有时间把前面函数也复习复习