c語言如何創(chuàng)建一個棧

在C語言中，可以通過使用數(shù)組和指針來創(chuàng)建一個棧數(shù)據(jù)結(jié)構(gòu)。下面是一個簡單的示例代碼：

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

#define MAX_SIZE 100

typedef struct {
    int data[MAX_SIZE];
    int top;
} Stack;

Stack* createStack() {
    Stack* stack = (Stack*)malloc(sizeof(Stack));
    stack->top = -1;
    return stack;
}

int isEmpty(Stack* stack) {
    return stack->top == -1;
}

int isFull(Stack* stack) {
    return stack->top == MAX_SIZE - 1;
}

void push(Stack* stack, int value) {
    if (isFull(stack)) {
        printf("Stack is full\n");
        return;
    }
    stack->data[++stack->top] = value;
}

int pop(Stack* stack) {
    if (isEmpty(stack)) {
        printf("Stack is empty\n");
        return -1;
    }
    return stack->data[stack->top--];
}

int peek(Stack* stack) {
    if (isEmpty(stack)) {
        printf("Stack is empty\n");
        return -1;
    }
    return stack->data[stack->top];
}

int main() {
    Stack* stack = createStack();

    push(stack, 1);
    push(stack, 2);
    push(stack, 3);

    printf("Top element: %d\n", peek(stack));

    printf("Popped element: %d\n", pop(stack));
    printf("Popped element: %d\n", pop(stack));

    printf("Top element: %d\n", peek(stack));

    return 0;
}

在這個示例代碼中，我們定義了一個Stack結(jié)構(gòu)體，包含一個整型數(shù)組data和一個整型top表示棧頂元素的索引。通過createStack函數(shù)來創(chuàng)建一個棧，isEmpty和isFull函數(shù)來判斷棧是否為空或滿，push函數(shù)用來入棧，pop函數(shù)用來出棧，peek函數(shù)用來查看棧頂元素。在主函數(shù)中我們演示了如何使用這些函數(shù)操作棧。