template<class T>
struct node
{
 T value; //儲存的值
 node<T>* next; 

 node() :next(nullptr){} //構造函數(shù)
 node(T t) :value(t), next(nullptr){}
};

template<class T>
class myStack
{
 int cnts; //入棧數(shù)量
 node<T> *head; //棧的頭部
public:

 myStack(){ cnts = 0; head = new node<T>; }
 void stackPush(T arg); //入棧
 T stackPop(); //出棧
 T stackTop(); //獲取棧頂元素

 void printStack(); //打印棧
 int counts(); //獲取棧內元素個數(shù)
 bool isEmpty(); //判斷空
};
template<class T>
void myStack<T>::stackPush(T arg)
{
 node<T> *pnode = new node<T>(arg); //申請入棧元素的空間
 pnode->next = head->next;
 head->next = pnode;
 cnts++;
}
template<class T>
T myStack<T>::stackPop()
{
 if (head->next!=nullptr) 
 {
  node<T>* temp = head->next;
  head->next = head->next->next;
  T popVal = temp->value;
  delete temp;
  return popVal;
 }
}
template<class T>
T myStack<T>::stackTop()
{
 if (head->next!=nullptr)
 {
  return head->next->value;
 }
}
template<class T>
void myStack<T>::printStack()
{
 if (head->next != nullptr)
 {
  node<T>* temp = head;
  while (temp->next != nullptr)
  {
   temp = temp->next;
   cout << temp->value << endl;
  }
 }
}
template<class T>
int myStack<T>::counts()
{
 return cnts;
}
template<class T>
bool myStack<T>::isEmpty()
{
 if (cnts)
  return false;
 else
  return true;
}