Stack设计Min函数栈（用一个栈或者用两个栈模拟）

代码比较简单，测试都懒得了，这个问题思想是精华。

#include<iostream>
using namespace std;

class Stack
{
private:
    int *elements;
    int top;
    int maxSize;

public:
    Stack(int sz=50):top(-1),maxSize(sz)
    {
        elements=new int[maxSize];
    }

    void push(int x)
    {
        elements[++top]=x;
    }

    int pop()
    {
        top--;
        return elements[top+1];
    }

    int peek()
    {
        return elements[top];
    }

    bool isEmpty()
    {
        return (top==-1)?true:false;
    }
};

class NewStack1
{
private:
    Stack dataStack;
    Stack minStack;
public:
    NewStack1()
    {
    }
    void push(int x)
    {
        dataStack.push(x);
        if(minStack.isEmpty())
            minStack.push(x);
        if(x>minStack.peek())
            minStack.push(minStack.peek());
        else
            minStack.push(x);
    }
    int pop()
    {
        if(dataStack.isEmpty())
        {
            cout<<"pop出错，栈为空!"<<endl;
        }
        minStack.pop();
        return dataStack.pop();
    }
    int min()
    {
        if(dataStack.isEmpty())
        {
            cout<<"pop出错，栈为空!"<<endl;
        }
        return minStack.peek();
    }
};

class NewStack2
{
private:
    Stack stack;
public:
    NewStack2()
    {
    }
    
    void push(int x)
    {
        if(stack.isEmpty())
        {
            stack.push(x);
            stack.push(x);
        }
        if(x>stack.peek())
        {
            int min=stack.peek();
            stack.push(x);
            stack.push(min);
        }
        else
        {
            stack.push(x);
            stack.push(x);
        }
    }
    
    int pop()
    {
        stack.pop();
        return stack.pop();
    }
    
    int min()
    {
        return stack.peek();
    }
};