主函数
int n,num,jz;
printf("请输入数和进制:");
scanf("%d%d",&num,&jz);
while (num)
{
n = num % jz;
push(S,n);
num = num/jz;
}
show(S);
被调函数-入栈
int push(seqStack *S,datatype e)
{
//判断逻辑
if(NULL == S || full(S))
{
printf("入栈失败\n");
return -1;
}
//入栈
S->top++;
S->data[S->top] = e;
printf("入栈成功\n");
return 0;
}
被调函数-遍历
void show(seqStack *S)
{
//判断逻辑
if(NULL == S || empty(S))
{
printf("遍历失败\n");
return;
}
printf("从栈底到站顶元素为:");
for (int i=S->top;i>=0;i--)
{
printf("%d\t",S->data[i]);
}
printf("\n");
}