bool PushStack(SqStack *&s,int e)
{
//若栈满，则入栈失败
if(StackFull(s))
{
return false;
}
s->top++;//栈顶指针加1
s->data[s->top]=e;//元素e放在栈顶指针处
return true;
}
PushStack(&t,m);//这里一直报错