栈的拷贝构造

C++实现栈类及操作

最新推荐文章于 2024-08-16 09:20:52 发布

原创最新推荐文章于 2024-08-16 09:20:52 发布 · 1.4k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#delete #null #struct #class

c/c++ 专栏收录该内容

8 篇文章

订阅专栏

此博客展示了用C++实现的栈类Stack。该类包含私有结构体node，有构造、拷贝构造和析构函数，还实现了入栈、出栈、显示栈和栈顶元素等操作，同时有静态变量记录栈的数量，通过友元函数可显示栈的数量。

class Stack
{
private:
   struct node
   {
       int data;
       node *next;
   }*top,*temp;
   static int stackNum;

public:
   Stack()
   {
       top=NULL;
       stackNum++;
   }

   Stack(Stack& p)
   {
       stackNum++;

   node *s,*q,*temp1,*head;
   head=new node;
   s=head;
   q=p.top;
       while(q)
       {

       temp1=new node;
       temp1->data=q->data;
       s->next=temp1;
       s=temp1;
        q=q->next;
       }
       s->next=NULL;
   top=head->next;

   }


   ~Stack()
   {
       delete top;
       cout<<"the stack is destroyed"<<endl;
       stackNum--;
   }
   void push()
   {
       temp=new node;
       cin>>temp->data;
       temp->next=top;
       top=temp;
   }
   void pop()
   {
       int popData;
       if (top==NULL)
           cout<<"error"<<endl;
       temp=top;
       popData=temp->data;
       top=top->next;
       cout<<popData<<" is poped"<<endl;
       delete temp;
   }

   void ShowStack()
   {
       temp=top;
       cout<<"the stack:"<<endl;
       while(temp)
       {
           cout<<temp->data<<" ";
               temp=temp->next;
       }
       cout<<endl;
   }

   void ShowTop()
   {
       cout<<"the top of stack"<<endl;
       cout<<top->data<<endl;
   }

   friend void stackNum();

};
int Stack::stackNum=0;

void stackNum()
   {
   cout<<"the number of stack is "<<Stack::stackNum<<endl;
   }