数据结构 栈作业

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

void main() {
    pushPopTest();
}

2.运行结果