class Stack { private: int top; int s[100]; public: void Ini_Stack(); void Push_Stack(int e); void Pop_Stack(); void Empty(); }void Stack::Ini_Stack() { memset(s, 0, sizeof(s)); top ^= top; }void Stack::Push_Stack(int e) { if(top == sizeof(s)/sizeof(int)) return; s[top++] = e; }void Stack::Pop_Stack() { if(!top) return; --top; }void Stack::Empty() { return (!top); }
内容全部来源于网络收集，如有侵权，请联系网站删除：QQ：24596024