包含min函数的栈

class Solution {
public:
    stack<int> dataStack,minStack;
    void push(int value) {
        dataStack.push(value);
        if(minStack.empty()){
            minStack.push(value);
        }
        else {
            int min=minStack.top();
            value<=min?minStack.push(value):minStack.push(min);
        }
    }
    void pop() {
        dataStack.pop();
        minStack.pop();
    }
    int top() {
        return dataStack.top();
    }
    int min() {
        return minStack.top();
    }
};