C++顺序栈.docVIP

一、利用栈类求进制转换： 顺序栈的应用： 1、用静态数组实现 #include iostream using namespace std; const int maxsize=10; class stack { float data[maxsize]; int top; public: stack(void); ~stack(void); bool empty(void); bool full(void); void push(float a); float pop(void); }; stack::stack() { top=0; coutstack initialized.endl; } stack::~stack() { coutstack destroyedendl; } bool stack::empty() { return top==0; } bool stack::full(void) {return top==maxsize ; } void stack::push(float a) { if(full()) coutStack overflow!endl; else { data[top]=a; top++; } } float stack::pop(void) { if(top==0) { coutAn empty stack!endl; return 0; } top--; return data[top]; } int main( ) { stack s; int num,base,x; cout请输入一个十进制数\n; cinnum; cout请输入转换后的进制\n; cinbase; while(num) { x=num%base; s.push(x); num=num/base; } cout转换为base进制的数为:\n; while(!s.empty()) {x=s.pop(); coutx;} coutendl; return 0; } 2、用动态数组实现 /*_############################################################################ _## 动态数组实现的堆栈 _## Author: qishx _## Time: 2010.4.8 _## sdupsl _## Development condition: winxp +VC6.0 _## _## dynamic_array.cpp 文件 _##########################################################################*/ #include iostream using namespace std; class Stack { int *data; int size; int top; public: Stack(int n=10 ); ~Stack( ); bool isEmpty( ); bool isFull(); void push(int a); int pop( ); }; Stack::Stack(int n) { size=n; data=new int[size]; top=-1; //将栈指针top置为-1 coutstack initialized.endl; } Stack::~Stack( ) { delete [] data; coutstack destroyed.endl; } bool Stack::isEmpty( ) { return top== -1?true:false; } bool Stack::isFull() { return top==size-1?true:false; } void Stack::push (int a) { if(isFull()) cout stack is full! endl; else { top ++; data[top]=a; } } /*改进的进栈操作 void Stack::push(int a) { if(top==size-1) { i