qq_49910228的博客

一、顺序队列的实现(LinearQueue.h)#pragma once#include<iostream>using namespace std;template<class T>class LinearQueue{public: LinearQueue(int LQMaxSize)//创建空队列 { MaxSize = LQMaxSize; element = new T[MaxSize]; size = 0; front = 0; r

一、顺序栈的实现(LinearStack.h)#pragma once#include<iostream>using namespace std;template<class T>class LinearStack{public: LinearStack(int LSMaxSize) { MaxSize = LSMaxSize; element = new T[LSMaxSize]; top = -1; } ~LinearStack() {

一、单向链表类模板(LinkList.h)#pragma once#include<iostream>using namespace std;template<class T>class LinkNode{ template<class T> friend class LinkList;//将链式表类声明为友类public: LinkNode()//构造函数 { next = NULL; }private: T data;//结点元素

一、顺序表类模板(LinearList.h)#pragma oncetemplate<class T>class LinearList{public: LinearList(int LLMaxSize)//构造函数，创建空表 { MaxSize = LLMaxSize; element = new T[LLMaxSize]; length = 0; } LinearList()//析构函数，删除表 { delete[]element; } Linear

给定个整数的序列,求函数