题解 | #【模板】栈#

#include <stdio.h>
#include <string.h>
#define MAX 100000
int main()
{
    int n,top=-1;
    int stack[MAX]={0};
    scanf("%d",&n);
    while(n--){
        char a[10];
        scanf("%s",a);
        if(!strcmp(a, "push"))
        {
            if(top==MAX-1)
            return 0;
            int x;
            scanf("%d",&x);
            stack[++top] = x;
            continue;
        }
        if(!strcmp(a, "pop"))
        {
            if(top==-1)
            {
            printf("error\n");
            continue;}
            else
            {
            printf("%d\n",stack[top--]);
            continue;}
        }
        if(!strcmp(a, "top"))
        {
            if(top==-1)
            {
            printf("error\n");
            continue;
            }
            else{
            printf("%d\n",stack[top]);
            continue;}
        }
    }
    return 0;
}