C++中数组栈模板、数组队列模板、循环队列模板、链表队列模板

动态数组来自于上一篇文章
1、使用动态数组模板创建栈模板
2、使用动态数组模板创建队列模板
3、重新创建队列模板

- 头文件1

Array.h

#pragma once
template<typename T>
class Array
{
   
public:
	Array(int capacity);
	Array();
	T& operator[](int i);
	int GetSize();
	int GetCapacity();
	bool IsEmpty();
	void add(int index, T e);
	void AddLast(T e);
	void AddFirst(T e);
	void toString();
	int get(T index);
	void set(int index, T e);
	bool contains(T e);
	int find(T e);
	//删除并返回
	T remove(int index);
	T removeFirst();
	T removeLast();
	void removeelement(T e);
	T GetLast();
	T GetFirst();
	~Array();

private:
	void reSize(int newcapacity);
protected:

private:
	int size;
	T *data;
	int capacity;
};

- 头文件2

ArrayQueue.h

#pragma once
#include "Array.h"
#include "QueueInterface.h"
template<typename T>
class ArrayQueue:public Queue<T>
{
   
public:
	ArrayQueue(int capacity);
	ArrayQueue();
	int GetSize();
	bool IsEmpty();
	int GetCapacity();
	void enQueue(T e);
	T deQueue();
	T GetFront();
	void toString();
	~ArrayQueue();
private:
	Array<T> array;
};

- 头文件3

ArrayStack.h

#pragma once
#include "Array.h"
#include "StackInterface.h"
template<typename T>
class ArrayStack:public Stack<T>
{
   
public:
	ArrayStack(int capacity);
	ArrayStack();
	int GetSize();
	bool IsEmpty();
	int getcapacity();
	void Push(T e);
	T pop();
	T peek();
	void toString();
	~ArrayStack();
private:
	Array<T> array;
};

- 头文件4/接口1

QueueInterface.h

#pragma once
template<typename T>
class Queue {
   
public:
	virtual int GetSize() = 0;
	virtual bool IsEmpty() = 0;
	virtual void enQueue(T e) = 0;
	virtual T deQueue() = 0;
	virtual T GetFront() = 0;
};

- 头文件5/ 接口2

StackInterface.h

#pragma once
template<typename T>
class Stack {
   
public:
	virtual int GetSize() = 0;
	virtual bool IsEmpty() = 0;
	virtual void Push(T e) = 0;
	virtual T pop() = 0;
	virtual T peek() = 0;
};

- 源文件1/实现头文件1

Array.hpp

#pragma once
#include "Array.h"
#include <string>
#include <iostream>
using namespace std;
template<typename T>
Array<T>::Array(int capacity) {
   
	cout << "Array(int)" << endl;
	data = new T[capacity];
	size = 0;
	this->capacity = capacity;
}
template<typename T>
Array<T>::Array() {
   
	cout << "Array()" << endl;
	this->capacity = 5;
	data = new T[capacity];
	size = 0;
}
template<typename T>
T& Array<T>::operator[](int i) {
   
	return data[i];
}
template<typename T>
int Array<T>::GetSize() {
   
	return size;
}
template<typename T>
int Array<T>::GetCapacity() {
   
	return capacity;
}
template<typename T>
bool  Array<T>::IsEmpty() {
   
	return size == 0;
}
template<typename T>
void Array<T>::add(int index, T e) {
   
	if (size == capacity) {
   
/*
		cout << "array is full,resize?(YorN)" << endl;
		char tmp;