2/26作业

1.link_stack.c

#include "link_stack.h"
//申请栈顶指针
top_p creat_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 creat_node(int data)
{
   link_p new = (link_p)malloc(sizeof(link_stack));
   if(new==NULL)
   {
       printf("申请空间失败\n");
       return NULL;
   }
   new->data=data;
   return new;
}
//判空
int empty(top_p T)
{
   if(T==NULL)
   {
       printf("入参为空\n");
   }
   return T->ptop==NULL?1:0;
}

//入栈
void push_stack(top_p T,int data)
{
   if(T==NULL)
   {
       printf("入参为空\n");
       return;
   }
   link_p new=creat_node(data);
   new->next=T->ptop;
   T->ptop=new;
   T->len++;
}

//出栈
void pop_stack(top_p T)
{
   if(T==NULL)
   {
       printf("入参为空\n");
       return;
   }
   if(empty(T))
   {
       printf("链栈为空\n");
       return;
   }
   link_p del=T->ptop;
   printf("出栈的元素为:%d\n",del->data);
   T->ptop=del->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 temp = T->ptop;
   while(temp != NULL)
   {
       printf("%d\n",temp->data);
       temp=temp->next;
   }
}
//销毁
void free_stack(top_p T)
{
   if(T==NULL)
   {
       printf("入参为空\n");
       return;
   }
   if(empty(T))
   {
       printf("链栈为空\n");
       return;
   }

   link_p temp = T->ptop;
   link_p del;
   while(temp!=NULL)
   {
       del=temp;
       temp=temp->next;
       free(del);
       T->len--;
       del=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 creat_top();
//判空
int empty(top_p T);
//入栈
void push_stack(top_p T,int data);
//出栈
void pop_stack(top_p T);
//遍历
void show_stack(top_p T);
//销毁
void free_stack(top_p T);

#endif

3.main.c

#include "link_stack.h"
int main()
{
   top_p T = creat_top();
   push_stack(T,1);
   push_stack(T,4);
   push_stack(T,9);
   show_stack(T);
   printf("-------------\n");
   pop_stack(T);
   show_stack(T);
   printf("-------------\n");
   pop_stack(T);
   show_stack(T);
   printf("-------------\n");

return 0;
}