Customized version of Stack C++(自定义版本)

Customized version of Stack C++(自定义版本)

Stack1.h

#ifndef stack_#define stack_#include "stdafx.h"//#include //using namespace std;//exceptionclass OutOfBounds{public: OutOfBounds(){}};//change array's sizetemplatevoid Changesize1D(T * &arr,const int& size,const int& ToSize){ T* tmp = new T[size]; tmp = arr; arr = new T[ToSize]; for(int i=0; i< size; ++i){ arr[i] = tmp[i]; } delete[] tmp;}template class Stack{ //friend ostream& operator<<(ostream&, const Stack&);public: Stack(); ~Stack(){delete []stack;}; T Top() const; void Pop(); void Push(const T& x); int Size() const; bool Empty();private: int top; int Maxtop; T* stack;};template Stack::Stack() { stack = new T[1]; top = -1; Maxtop = 0;}template T Stack::Top() const{ if(top == -1){ throw OutOfBounds(); }else{ return stack[top]; }}template void Stack::Pop(){ --top; //change array capacity when the list size drops to //one-fourth of the array capacity if((top + 1 <= (Maxtop + 1)/4) && Maxtop >0){ Maxtop = (Maxtop - 1)/2; Changesize1D(stack,top + 1, Maxtop + 1); }}template void Stack::Push(const T& x){ //if there is not enough space to accommodate the new element, //double the array capacity if(top == Maxtop){ Maxtop = Maxtop * 2 + 1; Changesize1D(stack,top + 1,Maxtop + 1); } stack[++top] = x; }template int Stack::Size() const{ return top + 1;};template bool Stack::Empty(){ return top == -1;}/*template ostream& operator<<(ostream& out, const Stack& s){ out << "The stack has " << s.Size() << " element(s)" << endl; return out;}*/#endif

Test it

// Stack.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include "Stack1.h"#include using namespace std;int main(int argc, char* argv[]){ Stack t; try { t.Top(); } catch (OutOfBounds e) { cout << "no element" << endl; } t.Push(1); cout << "after push 1, the top:" << t.Top() << endl; cout << "after push 1, is empty?:" <

​

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。