颠倒栈

颠倒栈

Description题目：用递归颠倒一个栈。例如输入栈{1, 2, 3, 4, 5}，1在栈顶。

颠倒之后的栈为{5, 4, 3, 2, 1}，5处在栈顶。Input
一行，包括一个正整数n（0<n<1000）和由n个不相同的整数组成的一个栈
Output
一行，颠倒之后的栈
Sample Input
6 1 2 3 4 5 6Sample Output
6 5 4 3 2 1

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAXLEN 50
typedef struct daoxu{char a_1[50],a_2[50];int top,top_1;
}numble;
numble *init_1()
{numble *s;if(s = (numble *)malloc(sizeof(numble))){s->top = 0;s->top_1 = 0;return s;}return NULL;
}
void push(numble *s,char c)
{if(s->top == MAXLEN){printf("栈溢出！");return;}s->a_1[s->top] = c;s->top++;
}
void pop(numble *s)
{printf("%c ",s->a_1[s->top - 1]);s->top--;return;
}
void zhan(numble *s,char *a)
{int i,k;for(i = 0;i < strlen(a);i++){push(s,a[i]);}for(k = 0;k < strlen(a);k++){pop(s);}
}
int main(void)
{int n;scanf("%d",&n);getchar();char *a;a = (char *)malloc(sizeof(char) * n);for(int i = 0;i < n;i++){scanf("%c",&a[i]);getchar();}numble *s;s = init_1();zhan(s,a);return 0;
}