数据结构—3.1栈作业

代码：

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

#define STACK_MAX_SIZE 10

typedef struct CharStack {
	int top;

	int data[STACK_MAX_SIZE];
}*CharStackPtr;


//打印
void outputStack(CharStackPtr paraStack) {
	for (int i = 0; i <= paraStack->top; i++) {
		printf("%c ", paraStack->data[i]);
	}//of for i
	printf("\r\n");
}//of outputStack

//初始化
CharStackPtr charStackInit() {
	CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
	resultPtr->top = -1;

	return resultPtr;
}//of charStackInit

//插入
void push(CharStackPtr paraStackPtr, int paraValue) {

	if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
		printf("Cannot push element: stack full.\r\n");
		return;
	}//of if

	paraStackPtr->top++;
	paraStackPtr->data[paraStackPtr->top] = paraValue;
}//of push

//删除
char pop(CharStackPtr paraStackPtr) {
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element: stack empty.\r\n");
		return '\0';
	}//of if

	paraStackPtr->top--;

	return paraStackPtr->data[paraStackPtr->top + 1];//返回被删除的数据
}//of pop


void pushPopTest() {
	char ch;

	printf("---- pushPopTest begins. ----\r\n");

	CharStackPtr tempStack = charStackInit();
	printf("After initialization,the stack is:");
	outputStack(tempStack);

	for (ch = 'a'; ch < 'm'; ch++) {
		printf("Pushing %c.\r\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}//of for i


	for (int i = 0; i < 3; i++) {
		ch = pop(tempStack);
		printf("Pop %c.\r\n", ch);
		outputStack(tempStack);
	}//of for i

	printf("---- pushing ends. ----\r\n");
}//of pushPopTest


void main() {
	pushPopTest();
}

运行结果：

分析及体会：

 

 栈是一种先进后出的数据结构，元素只能从一端（栈顶）入栈和出栈。