MinStack Class Reference

Collaboration diagram for MinStack:

Public Member Functions
	MinStack ()
void	push (int val)
void	pop ()
int	top ()
int	getMin ()

Private Attributes
stack< int, deque< int > >	s
priority_queue< int, vector< int >, greater< int > >	q

Detailed Description

Definition at line 5 of file main.cpp.

Constructor & Destructor Documentation

MinStack()

MinStack::MinStack ( )

inline

Definition at line 12 of file main.cpp.

: s(), q() {}

Member Function Documentation

getMin()

int MinStack::getMin ( )

inline

Definition at line 62 of file main.cpp.

    {
        if (s.empty() || q.empty())
        {
            if (s.empty())
                throw runtime_error("min-stack.getMin: empty stack");
            else
                throw runtime_error("min-stack.getMin: empty priority queue");
        }
        return q.top();
    }

References q, and s.

pop()

void MinStack::pop ( )

inline

Definition at line 20 of file main.cpp.

    {
        if (s.empty() || q.empty())
        {
            if (s.empty())
                throw runtime_error("min-stack.pop: empty stack");
            else
                throw runtime_error("min-stack.pop: empty priority queue");
            return;
        }
        int el = s.top();
        queue<int> temp;
        while (!q.empty() && q.top() != el)
        {
            temp.push(q.top());
            q.pop();
        }
        if (!q.empty())
        {
            q.pop();
            while (!temp.empty())
            {
                q.push(temp.front());
                temp.pop();
            }
        }
        s.pop();
    }

References q, and s.

push()

void MinStack::push ( int  val )

inline

Definition at line 14 of file main.cpp.

    {
        s.push(val);
        q.push(val);
    }

References q, and s.

top()

int MinStack::top ( )

inline

Definition at line 49 of file main.cpp.

    {
        if (s.empty() || q.empty())
        {
            if (s.empty())
                throw runtime_error("min-stack.top: empty stack");
            else
                throw runtime_error("min-stack.top: empty priority queue");
            return -1;
        }
        return s.top();
    }

References q, and s.

Field Documentation

q

priority_queue<int, vector<int>, greater<int> > MinStack::q

private

Definition at line 9 of file main.cpp.

Referenced by getMin(), pop(), push(), and top().

s

stack<int, deque<int> > MinStack::s

private

Definition at line 8 of file main.cpp.

Referenced by getMin(), pop(), push(), and top().

---

The documentation for this class was generated from the following file:

• main.cpp