数据结构作业--栈

代码

#include<stdio.h>
#include<malloc.h>

#define MAX 10

//定义一个数据结构类型
typedef struct CharStack{
	int top;
	
	int data[MAX];
} *CharStackPtr;

//遍历栈
void outputStack(CharStackPtr paraStack)
{
	for(int i=0;i<=paraStack->top;i++)
	{
		printf("%c ",paraStack->data[i]);
	}
	printf("\r\n");
 } 
 
 //建立一个空的栈块 
CharStackPtr charStackInit()
{
	CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
	resultPtr->top = -1;
	
	return resultPtr;
}

void push(CharStackPtr paraStackPtr, int paraValue)
{
	//检查是否有空间 
	if(paraStackPtr->top>=MAX-1)
	{
		printf("Cannot push element: stack full.\r\n");
		return ;
	}
	
	//更新top 
	paraStackPtr->top ++;
	
	//将数据放入栈中 
	paraStackPtr->data[paraStackPtr->top] =paraValue;
}

char pop(CharStackPtr paraStackPtr)
{
	//space check
	if(paraStackPtr->top < 0)
	{
		printf("Cannot pop element: stack empty.\r\n");
		return '\0';
	}
	
	//更新top 
	paraStackPtr->top--;
	
	//放入数据 
	return paraStackPtr->data[paraStackPtr->top+1];
}

void pushPopTest()
{
	printf("---- pushPopTest begins. ----\r\n");
	
	//Initialize
	CharStackPtr tempStack = charStackInit();
	printf("After initialization, the stack is: ");
	outputStack(tempStack);
	
	//pop
	char ch = 'a';
	for( ch = 'a';ch<'m';ch++)
	{
		printf("Pushing %c.\r\n",ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}
	
	
	for(int i=0;i<3;i++)
	{
		ch = pop(tempStack);
		printf("Pop  %c .\r\n",ch);
		outputStack(tempStack);
	}
	
	printf("---- pushPopTest ends. ----\r\n");
	


}

int main()
{
	pushPopTest();
}

运行结果