實驗二 順序棧

#include<iostream> using namespace std; const int StackSize=10; class SeqStack { public: SeqStack(){top=-1;} ~SeqStack(){} void Push(int x); int Pop(); int GetTop() {if(top!=-1) return data[top];} int

>>阅读原文<<