stack.h

解决8皇后问题的程序。输出多组解的中间加入停顿

const int SSize = 8;
typedef int SType;

class Stack {
 private:
   SType data[SSize];
   int Top;
 public:
   Stack() { Top = 0; }
   ~Stack() { }
   bool isEmpty() { return !Top; }
   int Size() { return Top; }
   bool Push(SType);
   bool Pop(SType &);
   bool StackTop(SType &);
};