【作业】栈 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]);
	} 
	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 >= 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() {
	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);
	}

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