借用template和vector類比Stack

來源:互聯網
上載者:User

類比代碼:

#include <iostream>#include <vector>#include <stdexcept>using namespace std;template <typename T>class Stack{private:vector<T> elems;public:void push( T const & element );void pop( );T top() const;bool empty()const{return elems.empty();}};template <typename T>void  Stack<T>::push( T const &element ){elems.push_back(element);}template <typename T>void Stack<T>::pop(){if( elems.empty() ){throw out_of_range("Stack<>::pop:empty stack");}elems.pop_back();}template < typename T >T Stack<T>::top()const{if( elems.empty() ){throw out_of_range("Stack<>::top:empty stack");}return elems.back();}int main(void){ Stack<int> stck_int; stck_int.push(1); stck_int.push(2);      cout << "入站順序:1,2" << endl; cout << "出站順序:" << endl; cout << stck_int.top() ; stck_int.pop(); cout.width(3); cout << stck_int.top() << endl; cout << "入站順序:A,B" << endl; cout << "出站順序:" << endl; Stack<char> stck_char; stck_char.push('A'); stck_char.push('B');  cout << stck_char.top() ; stck_char.pop(); cout.width(3); cout << stck_char.top() << endl;     return 0; }

運行效果:

入站順序:1,2
出站順序:
2  1
入站順序:A,B
出站順序:
B  A

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.