C++ stack<T>栈模型基本操作

C++ stack栈模型基本操作

栈是一种后进先出的数据模型

#include <iostream>
#include <stack>
using namespace std;

class Teacher
{
public:
	Teacher(int age)
	{
		this->age = age;
	}
	void printT()
	{
		cout << "age: " << age << endl;
	}
private:
	int		age;
	char	name[32];
};

int main()
{
	stack<int> s;

	//1 入栈
	for (int i = 0; i < 10; i++)
	{
		s.push(i + 1);
	}
	cout << "栈的大小: " << s.size() << endl;

	//2 出栈
	while (!s.empty())
	{
		cout << s.top() << " ";//获取栈顶元素
		s.pop();//弹出栈顶元素
	}
	cout << endl;
	//10 9 8 7 6 5 4 3 2 1

	//3 栈的算法和数据类型的分离
	Teacher t1(11), t2(22), t3(33);
	stack<Teacher> s2;
	s2.push(t1);
	s2.push(t2);
	s2.push(t3);
	while (!s2.empty())
	{
		s2.top().printT();//输出栈顶元素
		s2.pop();//弹出栈顶元素
	}

	stack<Teacher*> s3;
	s3.push(&t1);
	s3.push(&t2);
	s3.push(&t3);
	while (!s3.empty())
	{
		s3.top()->printT();
		s3.pop();
	}

	return 0;
}