/**
***@Title :考研數據結構複習
***@Subject :棧(順序結構)
***@Author :lxfhahaha
***@language: C語言
***@Time : 2018/9/26 15:29
*****/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define Inital_Size 50
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int Bool;
typedef int SElemType;
typedef int Status;
typedef struct {
SElemType *base;
SElemType *top;
int stacksize; //當前已分配的存儲空間
}SqStack;
//操作結果:構造一個空棧
Status InitStack(SqStack *stack){
stack->base=(SElemType*)malloc(Inital_Size*sizeof(SElemType));
if(!stack->base){
printf("Malloc Error!\n");
exit(0);
}
stack->top=stack->base;
stack->stacksize=Inital_Size;
return OK;
}
//銷燬棧,stack不再存在
Status DestroyStack(SqStack *stack){
if(!stack->base){ //不存在
return ERROR;
}else{
free(stack->base);
stack->top=NULL;
stack->base=NULL;
stack->stacksize=0;
return OK;
}
}
//把stack置爲空棧
Status ClearStack(SqStack *stack){
if(!stack->base){
printf("Error!! Please inital first!!\n");
return ERROR;
}
stack->top=stack->base;
return OK;
}
//若stack爲空,返回TRUE,非空返回FALSE
Bool StackEmpty(SqStack stack){
if(!stack.base){
printf("Error!! Please inital first!!\n");
exit(0);
}
return stack.base==stack.top? TRUE : ERROR;
}
//返回stack中數據元素個數
int StackLength(SqStack stack){
if(!stack.base){
printf("Error!! Please inital first!!\n");
exit(0);
}
return stack.top-stack.base ;
}
//若棧不空,則若e返回棧頂的元素,並返回OK,否則返回ERROR
Status GetTop(SqStack stack,SElemType *e){
if(!stack.base){
printf("Error!! Please inital first!!\n");
exit(0);
}
if(stack.base==stack.top){
*e=NULL;
return ERROR;
}
*e=*(stack.top-1);
return OK;
}
//插入元素e爲新的棧頂元素
Status Push(SqStack *stack,SElemType e){
if(!stack->base){
printf("Error!! Please inital first!!\n");
exit(0);
}
if(stack->top-stack->base>=stack->stacksize){
SElemType *new_base=(SElemType *)realloc(stack->base,(stack->stacksize+Inital_Size)*sizeof(SElemType));
if(!new_base){
printf("Realloc Error");
exit(0);
}
stack->base=new_base;
stack->top=stack->base+stack->stacksize;
stack->stacksize+=Inital_Size;
}
*(stack->top)=e;
stack->top++;
return OK;
}
//若棧不空,則刪除stack的棧頂元素,用e返回其值,並返回OK;否則返回ERROR
Status Pop(SqStack *stack,SElemType *e){
if(!stack->base){
printf("Error!! Please inital first!!\n");
exit(0);
}
if(stack->top==stack->base){
return ERROR;
}
*e=*(stack->top-1);
stack->top--;
return OK;
}
//從棧底到棧頂依次對棧中每個元素調用visit(),一旦visit()失敗,則操作失敗
Status StackTraverse(SqStack stack,Status (*visit)(SElemType)){
int length=StackLength(stack);
while(length--){
if(!(*visit)(*(stack.base)))
exit(0);
stack.base++;
}
return OK;
}
//test1——print
Status PrintOne(SElemType one){
printf("%d->",one);
return OK;
}
int main()
{
SqStack stack;
int i,j;
SElemType a,b,c,d;
InitStack(&stack);
srand((int)time(0));
for(i=1;i<=10;i++)
Push(&stack,(SElemType)rand()%100);
printf("[");
StackTraverse(stack, PrintOne);
printf("]");
printf("\nlength:%d\n",StackLength(stack));
GetTop(stack,&a);
printf("IsEmpty:%d Top:%d\n\n",StackEmpty(stack),a);
ClearStack(&stack);
printf("[");
StackTraverse(stack, PrintOne);
printf("]");
printf("\nlength:%d\n",StackLength(stack));
GetTop(stack,&a);
printf("IsEmpty:%d Top:%d\n\n",StackEmpty(stack),a);
for(i=1;i<=10;i++)
Push(&stack,(SElemType)rand()%100);
printf("[");
StackTraverse(stack, PrintOne);
printf("]");
printf("\nlength:%d\n",StackLength(stack));
GetTop(stack,&a);
printf("IsEmpty:%d Top:%d\n\n",StackEmpty(stack),a);
Pop(&stack, &b);
printf("Pop one:%d\n",b);
printf("[");
StackTraverse(stack, PrintOne);
printf("]");
printf("\nlength:%d\n",StackLength(stack));
GetTop(stack,&a);
printf("IsEmpty:%d Top:%d\n\n",StackEmpty(stack),a);
DestroyStack(&stack);
printf("[");
StackTraverse(stack, PrintOne);
printf("]");
return 0;
}
考研數據結構複習——棧(順序表)
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.