首页 > 代码库 > stack2
stack2
?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 | #include<iostream> using namespace std; template < class Object> class Stack{ private : struct Node{ Object data; Node * next; Node( const Object & theelem , Node * n = NULL) :data(theelem),next(n){} }; Node * topOfStack; int stacklen; public : Stack(Object & x) { Node * p = new Node(x); topOfStack = p; stacklen = 0; } void makeEmpty() { while (isEmpty()) { Node * p = new Node(); p = topOfStack; topOfStack = topOfStack -> next; delete p; } } bool isEmpty() const { if (NULL == topOfStack) return true ; return false ; } Object Top() const { return topOfStack -> data; } void Pop() { if (!isEmpty()) { Node * p = topOfStack; cout<<p->data<< " " ; topOfStack = topOfStack -> next; delete p; stacklen--; } } void Push( const Object & x) { Node * p = new Node(x); p ->next = topOfStack; topOfStack = p; stacklen++; } ~Stack(){ Node * next ; while (topOfStack) { next = topOfStack ->next; delete topOfStack; topOfStack = next; } } }; int main() { int a = 1; Stack< int > dusk(a); for ( int i = 0 ; i < 5 ; i++) { dusk.Push(i); } for ( int i = 0 ; i < 5 ; i++) { dusk.Pop(); } } |
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。