设计包含 min 函数的栈

    最近一直复习数据结构方面的内容，刚看到堆栈这一部分，想找写题目来练练手，于是从何海涛大哥的博客上翻来一道google的面试题，题目如下：
    设计包含 min 函数的栈，定义栈的数据结构，要求添加一个 min 函数，能够得到栈的最小元素。要求函数 min 、 push 以及 pop 的时间复杂度都是 O(1) 。

 

    首先考虑到时间复杂度为o(1)，因此不可能对栈内的元素进行排序。而事实上min函数只是要求得到栈的最小元素，也没有必要排序。最先想到的就是在每个元素入栈的时候，把最小元素保存起来，每个元素入栈只需和入栈前的最小元素进行比较即可，因此时间复杂度为o(1),符合题目的要求。在元素出栈的时候，也要更新栈的最小元素，因此新元素入栈前的最小元素也要保存。可以考虑引入一个辅助栈，用来保存入栈后的最小元素，只要保持辅助栈和元素栈的操作保持一致，则辅助栈栈顶的元素即为元素栈的最小元素。最后考虑到栈的元素可能是一个复杂的对象，因此辅助栈中只保存最小元素在栈中的位置。

 

以下是参考代码，顺便复习了一下栈的公式化描述形式和链表描述形式

公式化描述：

#include "stdafx.h" #include <iostream> using namespace std; class StackFull //exception: stack is full { public: StackFull(){}; }; class StackEmpty //exception: stack is empty { public: StackEmpty(){}; }; template<class T> class Stack { public: Stack(const int MaxSize = 10); ~Stack(); bool IsEmpty() const; bool IsFull() const; const T& Top() const; //the top element value is not allowed to be changed Stack<T>& Push(const T& element); Stack<T>& Pop(); const T& Min() const; //the min element value is not allowed to be changed private: int m_nMaxSize; //maxsize of stack T* m_Elements; //stack element array int m_nTop; //top index int* m_Mins; //min element index array }; template<class T> Stack<T>::Stack(const int MaxSize /* = 10 */) { //initializer m_nMaxSize = MaxSize; m_Elements = new T[MaxSize]; m_Mins = new int[MaxSize]; m_nTop = -1; } template<class T> Stack<T>::~Stack() { delete[] m_Elements; delete[] m_Mins; } template<class T> bool Stack<T>::IsEmpty() const { return m_nTop == -1; } template<class T> bool Stack<T>::IsFull() const { return m_nTop == m_nMaxSize - 1; } template<class T> const T& Stack<T>::Top() const { if (IsEmpty()) { throw StackEmpty(); } return m_Elements[top]; } template<class T> Stack<T>& Stack<T>::Push(const T& element) { if (IsFull()) //Stack is Full { throw StackFull(); } else { ++m_nTop; //move top index m_Elements[m_nTop] = element; m_Mins[m_nTop] = m_nTop == 0 || m_Elements[m_Mins[m_nTop - 1]] > element ? m_nTop : m_Mins[m_nTop - 1]; //record the index of the min element return *this; } } template<class T> Stack<T>& Stack<T>::Pop() { if (IsEmpty()) //stack is empty { throw StackEmpty(); } else { --m_nTop; //move top index return *this; } } template<class T> const T& Stack<T>::Min() const { if (IsEmpty()) //stack is empty { throw StackEmpty(); } else { return m_Elements[m_Mins[m_nTop]]; } } int main() { Stack<int> stack; try { stack.Push(1); cout << stack.Min() << endl; stack.Push(5); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Push(-1); cout << stack.Min() << endl; stack.Push(-3); cout << stack.Min() << endl; stack.Push(-1); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Pop(); } catch (StackEmpty e) { cout << "stack is empty" << endl; } catch (StackFull e) { cout << "stack is full!" << endl; } return 0; }
链表描述：

#include "stdafx.h" #include <iostream> using namespace std; class StackFull //exception: stack is full { public: StackFull(){}; }; class StackEmpty //exception: stack is empty { public: StackEmpty(){}; }; template<class T> struct Node //stack node { T data; Node<T>* link; }; template<class T> struct MinNode //assistant stack node { Node<T>* minNode; //point to the min element node MinNode<T>* link; //point to the previous min node }; template<class T> class Stack { private: Node<T>* pTop; MinNode<T>* pMinTop; public: Stack(); ~Stack(); bool IsEmpty() const; const T& Top() const; //the top element value is not allowed to be changed Stack<T>& Push(const T& element); Stack<T>& Pop(); const T& Min() const; //the min element value is not allowed to be changed }; template<class T> Stack<T>::Stack() { pTop = 0; pMinTop = 0; } template<class T> Stack<T>::~Stack() { //release resources Node<T>* pNode = pTop; MinNode<T>* pMinNode = pMinTop; while (pNode != 0) { pNode = pNode->link; delete pTop; pTop = pNode; pMinNode = pMinNode->link; delete pMinTop; pMinTop = pMinNode; } } template<class T> bool Stack<T>::IsEmpty() const { return pTop == 0; } template<class T> const T& Stack<T>::Top() const { if (IsEmpty()) { throw StackEmpty(); } else { return pTop->data; } } template<class T> Stack<T>& Stack<T>::Push(const T& element) { //push element to stack; Node<T>* pNode = new Node<T>(); pNode->data = element; pNode->link = pTop; pTop = pNode; //push min element to assistant stack MinNode<T>* pMinNode = new MinNode<T>(); pMinNode->minNode = pMinTop == 0 || pMinTop->minNode->data > element ? pTop : pMinTop->minNode; pMinNode->link = pMinTop; pMinTop = pMinNode; return *this; } template<class T> Stack<T>& Stack<T>::Pop() { if (IsEmpty()) //stack is empty { throw StackEmpty(); } //pop the top element from the stack Node<T>* pNode = pTop->link; delete pTop; pTop = pNode; //pop the top min element from the assistant stack MinNode<T>* pMinNode = pMinTop->link; delete pMinTop; pMinTop = pMinNode; return *this; } template<class T> const T& Stack<T>::Min() const { if (IsEmpty()) { throw StackEmpty(); } return pMinTop->minNode->data; } int main() { Stack<int> stack; try { stack.Push(1); cout << stack.Min() << endl; stack.Push(5); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Push(-1); cout << stack.Min() << endl; stack.Push(-3); cout << stack.Min() << endl; stack.Push(-1); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Pop(); cout << stack.Min() << endl; stack.Pop(); } catch (StackEmpty e) { cout << "stack is empty" << endl; } catch (StackFull e) { cout << "stack is full!" << endl; } return 0; }

    解法引入了辅助栈，增加了程序运行时额外的空间，应该说是典型的以空间换时间的方法。想来想去没想到更好的方法，看了一下何海涛大哥的解法(http://zhedahht.blog.163.com/blog/static/25411174200712895228171/)，发现思路还是一致的(呵呵，看来这道题还是比较简单的)，不过看了何海涛大哥的代码之后，发现自己的代码太小儿科了...