c++ 栈的链式表示
#include<iostream>
using namespace std;
struct Node
{
int data;
Node* next;
};
class LinkStack
{
public:
LinkStack();
~LinkStack();
void Push(int m);
int Pop() ;
void DispStack();
int Getintop();
bool Empty() const;
void ClearStack();
LinkStack operator=( LinkStack& s)
{
int m;
while(s.Empty()!= 1)
{
m = s.Getintop();
cout<<m;
Push(m);
}
return *this;
}
private:
Node *top;
};
LinkStack::LinkStack()
{
top = NULL;
}
LinkStack::~LinkStack()
{
Node *p;
while(top)
{
p = top;
top = top->next;
delete p;
}
}
void LinkStack::Push(int m)
{
Node *s = new Node;
s->data = m;
s->next =top;
top = s;
}
int LinkStack::Pop()
{
if(top == NULL)
{
cout<<"error";
return NULL;
}
Node *s;
s = top;
int m;
m = top->data;
top = top->next;
delete s;
return m;
}
int LinkStack::Getintop()
{
if(top ==NULL)
{
cout<<"error"<<endl;
return NULL;
}
else
return top->data;
}
bool LinkStack::Empty() const
{
if(NULL == top)
return 1;
else
return 0;
}
void LinkStack::ClearStack()
{
Node *p;
while(top)
{
p = top;
top = top->next;
delete p;
}
}
void LinkStack::DispStack()
{
Node *s = top;
while(s)
{
cout<<s->data<<" ";
s = s->next;
}
cout<<endl;
}
#include<iostream>
#include "LinkStack.h"
using namespace std;
LinkStack conversion(int N)
{
LinkStack stack;
while(N)
{
stack.Push(N%8);
N = N/8;
}
/*while(!stack.Empty())
{
int m = stack.Pop();
cout<<m<<" ";
}*/
cout<<stack.Getintop()<<endl;
stack.DispStack();
return stack;
}
int main()
{
int N;
cout<<"input the numbers"<<endl;
cin>>N;
LinkStack stack1;
stack1 = conversion(N);
//conversion(N);
while(!stack1.Empty())
{
int m = stack1.Pop();
cout<<m<<" ";
}
return 0;
}
