栈类C++实现

来源：互联网发布：人工智能综合报告编辑：程序博客网时间：2024/05/17 07:05

头文件stack.h：

#pragma  once//用数组实现栈，数组索引为0的位置为栈底，索引top指向栈顶template<typename T>class Stack{public:Stack(int capcity=20);~Stack();void ClearStack();bool isEmpty();bool isFull();int StackLength();T GetTop();void Push(T e);void Pop();private:T* elemArray;int top;int capcity;};

实现文件stack.cpp：

#include "stack.h"#include <afxwin.h>#include <iostream>using namespace std;template<typename T>Stack<T>::Stack(int capcity){if (capcity<0){MessageBox(NULL,TEXT("the capcity is illegal"),TEXT(""),MB_OK);return;}this->capcity=capcity;top=0;elemArray=new T[capcity];}template<typename T>Stack<T>::~Stack(){delete[] elemArray;}template<typename T>void Stack<T>::ClearStack(){top=0;}template<typename T>bool Stack<T>::isEmpty(){return (top==0);}template<typename T>bool Stack<T>::isFull(){return (top==capcity);}template<typename T>int Stack<T>::StackLength(){return top;}template<typename T>T Stack<T>::GetTop(){if (isEmpty()){MessageBox(NULL,TEXT("the stack is empty"),TEXT(""),MB_OK);return 0;}return elemArray[top-1];}template<typename T>void Stack<T>::Push(T e){if (isFull()){cout<<"The stack is full"<<endl;return;}elemArray[top]=e;top++;}template<typename T>void Stack<T>::Pop(){if (isEmpty()){MessageBox(NULL,TEXT("the stack is empty"),TEXT(""),MB_OK);return ;}top--;}

注意：在测试栈类时，对栈类的正确引用时：#include "stack.cpp"

0 0