包含min的栈~~剑指offer21题

最新推荐文章于 2022-03-18 21:51:16 发布

eslin依依

最新推荐文章于 2022-03-18 21:51:16 发布

阅读量368

点赞数

分类专栏： c++

本文链接：https://blog.csdn.net/lijing805326040/article/details/38982151

版权

c++ 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

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

stack<int> m_data;
stack<int> m_min;

void stackwithminpush(int Element)
{
	int top;
	m_data.push(Element);
	if(m_min.empty())
	{
		m_min.push(Element);
	}
	else
	{
	top=m_min.top();
	m_min.push(min(Element,top));
	}

}
int stackwithminmin()
{
	return m_min.top();
}

void stackwithminpop()
{
	m_data.pop();
	m_min.pop();
}
int  main()
{
	 stackwithminpush(3);
	 cout<<stackwithminmin()<<endl;
	 stackwithminpush(4);
	 cout<<stackwithminmin()<<endl;
	 stackwithminpush(2);
	 cout<<stackwithminmin()<<endl;
	 stackwithminpush(1);
	 cout<<stackwithminmin()<<endl;
	 stackwithminpop();
	 cout<<stackwithminmin()<<endl;
	 stackwithminpop();
	 cout<<stackwithminmin()<<endl;
	 stackwithminpush(0);
	 cout<<stackwithminmin()<<endl;
	 return 0;
}