栈的理解

定义栈

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]);
	}

	printf("\r\n");
}

申请

CharStackPtr charStackInit() {
	CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(CharStack));
	resultPtr->top = -1;

	return resultPtr;
}

栈顶存储数据

void push(CharStackPtr paraStackPtr, int paraValue) {
	if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
		printf("Cannot push element: stack full.\r\n");
		return;
	}
	paraStackPtr->top ++;
	paraStackPtr->data[paraStackPtr->top] = paraValue;
}

栈顶取出数据

char pop(CharStackPtr paraStackPtr) {
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element: stack empty.\r\n");
		return '\0';
	}
	paraStackPtr->top --;
	return paraStackPtr->data[paraStackPtr->top + 1];
}

打印测试

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


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


	for (char ch = 'a'; ch < 'm'; ch ++) {

		printf("Pushing %c.\r\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}


	for (int i = 0; i < 3; i ++) {

		char ch = pop(tempStack);
		printf("Pop %c.\r\n", ch);
		outputStack(tempStack);
	}

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


int main() {
	pushPopTest();
}

运行