数据结构8-链栈

#include<iostream>
using namespace std;

struct People
{
	int id;
	string name;
	int age;
};
template <class Element>
struct Node
{
	Element data;
	Node<Element>* next;
};
template <class Element>
class LinkStack
{
public:
	LinkStack();
	~LinkStack();
	void push(Element x);
	Element pop();
	Element getTop();
	bool ifEmpty();
	void menu();
private:
	Node<Element>* top;
};
template <class Element>
LinkStack<Element>::LinkStack()
{
	top = nullptr;
}
template <class Element>
LinkStack<Element>::~LinkStack()
{
	Node<Element>* p=top;
	while (top)
	{
		top = top->next;
		delete p;
		p = top;
	}
}
template <class Element>
void LinkStack<Element>::push(Element x)
{
	Node<Element>* s = new Node<Element>;
	s->data = x;
	s->next = top;
	top = s;
}
template <class Element>
Element LinkStack<Element>::pop()
{
	Node<Element>* p = top;
	Element x = p->data;
	top = top->next;
	delete p;
	return x;
}
template <class Element>
Element LinkStack<Element>::getTop()
{
	return top->data;
}
template <class Element>
bool LinkStack<Element>::ifEmpty()
{
	if (top)return 0;
	else return 1;
}
template <class Element>
void LinkStack<Element>::menu()
{
	int choice=0;
	int pId = 0;
	string pName;
	int pAge = 0;
	int pos = 0;
	People p1 = { pId, pName, pAge };
	Element x;
	
	/*实现链栈的构造,析构,入栈,出栈,
	取栈顶元素,判断栈空,菜单*/
	cout <<"-----菜单-----"<< endl;
	cout <<"1.取栈顶元素\t2.判断是否为空"<< endl;
	cout <<"3.入栈\t4.出栈"<< endl;
	cout <<"请输入你要实现的操作:";
	cin >> choice;
	cout << endl;
	switch (choice)
	{
	case 1:
		x = getTop();
		cout<<"栈顶元素为:"<<x.id<<" "<<x.name<<" "<<x.age<<endl;
		break;
	case 2:
		if (ifEmpty())
		{
			cout << "此栈为空" << endl;
		}
		else
		{
			cout << "此栈非空" << endl;
		}
		break;
	case 3:
		pId=0; 
		pAge=0;
		pos=0;
		
		cout << "请输入你要入栈的人物的id:";
		cin >> pId;
		cout << endl;
		cout << "请输入你要入栈的人物的name:";
		cin >> pName;
		cout << endl;
		cout << "请输入你要入栈的人物的age:";
		cin >> pAge;
		cout << endl;
		p1={ pId, pName, pAge };
		push(p1);
		cout << endl;
		break;
	case 4:
		x = pop();
		cout << "出栈元素为:" << x.id << " " <<x.name << " " << x.age << endl;
		break;
	default:
		cout << "你输入的数字有误,请重新输入" << endl;
		break;
	}

}
int main()
{

	LinkStack<People> s1;
	while (1)
	{
		s1.menu();
	}


	return 0;
}

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值