栈_数组实现栈_0303

#Makefile

all:
    gcc stack.c -c -o stack.o
    gcc main.c -c -o main.o
    gcc stack.o main.o -o main
clean:
    rm *.o main
.PHONY:clean all

//stack.h

#ifndef STACK_H
#define STACK_H

#include <stdbool.h>
#define MAX 100
int arr[MAX];
int top = 0;
void push(char);
char pop(void);
bool is_empty(void);
bool is_full(void);

#endif //STACK_H

//stack.c

#include "stack.h"

void push(char ch)
{
    arr[top++] = ch;
}

char pop(void)
{
    return arr[--top];
}

bool is_empty(void)
{
    return top == 0;
}

bool is_full(void)
{
    return top == 100;
}

//main.c

#include <stdio.h>
#include "stack.h"

int main(int argc, const char *argv[])
{
    char ch;

    while((ch = getchar()) != '\n')
    {
        if(! is_full())
            push(ch);
    }
    putchar('\n');
    while(! is_empty())
    {
        putchar(pop());
    }


    return 0;
}