[NK]包含min函数的栈

包含min函数的栈
题目描述
定义栈的数据结构，请在该类型中实现一个能够得到栈中所含最小元素的min函数（时间复杂度应为O（1））。

#include "stdafx.h"
#include<stack>
#include<list>
#include <iostream>
using namespace std;

class Solution {
public:
    stack<int> stack1;
    list<int> min1;
public:
    void push(int value) {
        stack1.push(value);
        min1.push_front(value);
        min1.sort();

    }
    void pop() {
        int a = stack1.top();
        list<int>::iterator it = min1.begin();
        for (; it!=min1.end();)
        {
            if (*it != a)
            {
                ++it;
            }
            else
            {
                min1.erase(it);
                break;
            }
        }
        min1.sort();
        stack1.pop();

    }
    int top() {
        return stack1.top();
    }
    int min() {
        return min1.front();
    }
};
int main()
{
    //["PSH3", "MIN", "PSH4", "MIN", "PSH2", "MIN", "PSH3", "MIN", "POP", "MIN", "POP", "MIN", "POP", "MIN", "PSH0", "MIN"]

    Solution *s = new Solution();
    s->push(3);
    cout << s->min() << " ";
    s->push(4);
    cout << s->min() << " ";
    s->push(2);
    cout << s->min() << " ";
    s->push(3);
    cout << s->min() << " ";
    s->pop();
    cout << s->min() << " ";
    s->pop();
    cout << s->min() << " ";
    s->pop();
    cout << s->min() << " ";
    s->push(0);
    cout << s->min() << " ";
    return 0;
}