【数据结构】顺序表（栈）增、删

源码

#include <stdio.h>
#include <stdlib.h>

typedef int E;

struct Stack {
    E * array;
    int capacity;
    int top;
};

typedef struct Stack * ArrayStack;

// 顺序表初始化栈
_Bool initStack(ArrayStack stack) {
    stack->array = malloc(sizeof(E) * 10);
    if (stack->array == NULL) return 0;
    stack->capacity = 10;
    stack->top = -1;

    return 1;
}

// 顺序表入栈
_Bool pushStack(ArrayStack stack, E element) {
    if (stack->top + 1 == stack->capacity) {
        int newCapacity = stack->capacity + (stack->capacity >> 1);
        E * newArray = realloc(stack->array, newCapacity * sizeof(E));
        if (newArray == NULL) return 0;
        stack->array = newArray;
        stack->capacity = newCapacity;
    }
    stack->top++;
    stack->array[stack->top] = element;

    return 1;
}

_Bool isEmpty(ArrayStack stack) {
    return stack->top == -1;
}

E popStack(ArrayStack stack) {
    return stack->array[stack->top--];
}

void printStack(ArrayStack stack) {
    printf("| ");
    for (int i = 0; i < stack->top + 1; ++i) {
        printf("%d, ", stack->array[i]);
    }
    printf("\n");
}

int main(void) {
    struct Stack stack;
    initStack(&stack);
    for (int i = 0; i < 10; ++i) {
        pushStack(&stack, i + 1);
    }
    printStack(&stack);

    while (!isEmpty(&stack)) {
        printf("%d ", popStack(&stack));
    }
}