剑指offer30.包含min函数的栈

剑指offer30.包含min函数的栈

题目描述

C++解答

#pragma once
#include<stack>
#include <stack>
#include <assert.h>
#include<iostream>
using namespace std;
class MinStack
{
public:
	MinStack() {}
	void push(int x);
	void pop();
	int top();
	int min();
private:
	stack<int> st1;
	stack<int> st2;
};
void MinStack::push(int x) {
    if (!st1.empty())
    {
        int m = st1.top();
        int n = st2.top();
        if (x > n)
        {
            st1.push(x);
            st2.push(n);
        }
        else
        {
            st1.push(x);
            st2.push(x);
        }
    }
    else {
        st1.push(x);
        st2.push(x);
    }

}
void MinStack::pop() {
    st1.pop();
    st2.pop();

}
int MinStack::top() {
    return st1.top();

}
int MinStack::min() {
    return st2.top();

}
void test()
{
    MinStack minStack ;
    minStack.push(-2);
    minStack.push(0);
    minStack.push(-3);
    int m = minStack.min();  
    cout << m << endl;
    minStack.pop();
    int n = minStack.top();      
    cout << n << endl;
    int k = minStack.min();   
    cout << k << endl;


}
int main()
{
    test();
    return 0;
}

结果