数据结构 栈 C++

#include<iostream>
#include<cstring>
#include<stdlib.h>
#include<stdio.h>
using namespace std;


//结点
class MyData
{
public:
MyData() :data(0), next(NULL){}//默认构造函数
MyData(int value) :data(value), next(NULL){}//带参数构造函数
int data;
MyData *next;
};


//栈结构
class Mystack
{
public:
Mystack():top(NULL){}//默认构造函数
void push(MyData data);
void pop(MyData *pdata);
bool isEmpty();
MyData *top;
};


//进栈
void Mystack::push(MyData data)
{
MyData *pData = NULL;
pData = new MyData(data.data);//每次获取新的节点地址
pData->next = top;//与原来栈顶结点相连
top = pData;//将新节点地址定为栈顶
}


//出栈
void Mystack::pop(MyData *data)
{
if (isEmpty())
{
printf("This stack is empty!");
return;
}
data->data = top->data;//给出栈结点赋值
MyData *p = top;
top=top->next;//栈顶结点指向下一个结点
delete p;
}


//判断是否为空栈
bool Mystack::isEmpty()
{
return(top == NULL);
}


int main(int argc, int *argv[])
{
int x;
MyData data(0);
Mystack s;
s.push(MyData(1));
s.push(MyData(2));
s.push(MyData(3));


s.pop(&data);//前面定义的data(0)结点的地址
cout << "pop:" << data.data << endl;
s.pop(&data);//前面定义的data(0)结点的地址
cout << "pop:" << data.data << endl;
s.pop(&data);//前面定义的data(0)结点的地址
cout << "pop:" << data.data << endl;
cout << "Empty=" << s.isEmpty() << endl;
cout << "If you want to exit,enter '0'" << endl;
cin >> x;
return 0;
}
//MyData data(0);
//Mystack s;
//int x=1;
//int com = 1;
//int choice;
//while (com)
//{
// cout << "please enter the number of command" << endl;
// cin >> choice;
// switch (choice)
// {
// case 1:
// //入栈
// while (x)
// {
// cout << "输入入栈的元素" << endl;
// cin >> x;
// if (0 == x)break;
// s.push(MyData(x));
// }
// break;
// case 2:
// //先定义需要插入的序号和值
// s.pop(&data);
// break;
// //case 3:
// // print(List);
// }

//}
// return 0;
//}