栈的最简单的应用——字符逆序输出

#include <stdio.h>

#define SIZE 512

int top = 0;

char stack[SIZE];

void push(char ch);

char pop(void);

int is_empty(void);

int main(void)

{

char ch;

while ((ch = getchar()) != '\n')

{

push(ch);

}

while (!is_empty())

{

printf("%c", pop());

}

return 0;

}

void push(char ch)

{

stack[top++] = ch;

}

char pop(void)

{

return stack[--top];

}

int is_empty(void)

{

return top == 0;

}