设计一个有getMin和getMax功能的栈(C++实现)

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

class ProStack {
public:
	ProStack() {//栈的构造函数,构造的同时标记最大值和最小值
		int in;//用来接收用户输入元素
		cout << "please input the element of stack:" << endl;
		while (cin >> in) {//结束输入:CTRL+D然后回车
			dominate.push(in);//存入主栈
			if (MaxSubsidiary.empty() || MaxSubsidiary.top() < in|| MaxSubsidiary.top() == in)
				MaxSubsidiary.push(in);
			if (MinSubsidiary.empty() || MinSubsidiary.top() > in || MinSubsidiary.top() == in)
				MinSubsidiary.push(in);
		}

	}
	void push(int in) {
		dominate.push(in);//存入主栈
		if (MaxSubsidiary.empty() || MaxSubsidiary.top() < in || MaxSubsidiary.top() == in)
			MaxSubsidiary.push(in);
		if (MinSubsidiary.empty() || MinSubsidiary.top() > in || MinSubsidiary.top() == in)
			MinSubsidiary.push(in);
	}
	void pop() {
		
		if (MaxSubsidiary.top
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
```c++ #include<iostream> using namespace std; template <class T> class Compare{ private: T a,b; public: Compare(T _a, T _b){ a=_a; b=_b; } T GetMax(){ return a>b?a:b; } T GetMin(){ return a<b?a:b; } }; template <class T> class Complex{ private: T real, imag; public: Complex(T _real, T _imag){ real=_real; imag=_imag; } friend bool operator > (const Complex& c1, const Complex& c2){ return c1.real*c1.real+c1.imag*c1.imag>c2.real*c2.real+c2.imag*c2.imag; } friend bool operator < (const Complex& c1, const Complex& c2){ return c1.real*c1.real+c1.imag*c1.imag<c2.real*c2.real+c2.imag*c2.imag; } }; template <class T> class Queue{ private: T*data; int front, rear, size; public: Queue(int _size){ data=new T[_size]; front=rear=0; size=_size; } ~Queue(){ delete[]data; } bool IsEmpty(){ return front==rear; } bool IsFull(){ return (rear+1)%size==front; } void Enqueue(T item){ if(IsFull()){ cout<<"Queue is full!"<<endl; return; } data[rear]=item; rear=(rear+1)%size; } T Dequeue(){ if(IsEmpty()){ cout<<"Queue is empty!"<<endl; return T(); } T item=data[front]; front=(front+1)%size; return item; } }; int main(){ Compare<int> c1(1,2); cout<<c1.GetMax()<<endl; cout<<c1.GetMin()<<endl; Complex<int> c2(1,2), c3(3,4); Compare<Complex<int>> c4(c2,c3); if(c2>c3){ cout<<"c2>c3"<<endl; } else{ cout<<"c2<=c3"<<endl; } if(c4.GetMax()==c3){ cout<<"Max is c3"<<endl; } Queue<int> q(5); q.Enqueue(1); q.Enqueue(2); q.Enqueue(3); q.Enqueue(4); q.Enqueue(5); q.Enqueue(6); while(!q.IsEmpty()){ cout<<q.Dequeue()<<" "; } cout<<endl; return 0; } ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值