摘：数据结构各种算法实现(C++模板)

OGeek|极客世界-中国程序员成长平台 › 门户 › 编程› C++›C++教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

1、顺序表

Seqlist.h

const int DefaultSize=100;

template <typename Type> class SeqList{

public:

SeqList(int sz=DefaultSize)

:m_nmaxsize(sz),m_ncurrentsize(-1){

if(sz>0){

m_elements=new Type[m_nmaxsize];

}

~SeqList(){

delete[] m_elements;

}

int Length() const{ //get the length

return m_ncurrentsize+1;

}

int Find(Type x) const; //find the position of x

int IsElement(Type x) const; //is it in the list

int Insert(Type x,int i); //insert data

int Remove(Type x); //delete data

int IsEmpty(){

return m_ncurrentsize==-1;

}

int IsFull(){

return m_ncurrentsize==m_nmaxsize-1;

}

Type Get(int i){ //get the ith data

return i<0||i>m_ncurrentsize?(cout<<"can't find the element"<<endl,0):m_elements[i];

}

void Print();

private:

Type *m_elements;

const int m_nmaxsize;

int m_ncurrentsize;

};

template <typename Type> int SeqList<Type>::Find(Type x) const{

for(int i=0;i<m_ncurrentsize;i++)

if(m_elements[i]==x)

return i;

cout<<"can't find the element you want to find"<<endl;

return -1;

}

template <typename Type> int SeqList<Type>::IsElement(Type x) const{

if(Find(x)==-1)

return 0;

return 1;

}

template <typename Type> int SeqList<Type>::Insert(Type x, int i){

if(i<0||i>m_ncurrentsize+1||m_ncurrentsize==m_nmaxsize-1){

cout<<"the operate is illegal"<<endl;

return 0;

}

m_ncurrentsize++;

for(int j=m_ncurrentsize;j>i;j--){

m_elements[j]=m_elements[j-1];

}

m_elements[i]=x;

return 1;

}

template <typename Type> int SeqList<Type>::Remove(Type x){

int size=m_ncurrentsize;

for(int i=0;i<m_ncurrentsize;){

if(m_elements[i]==x){

for(int j=i;j<m_ncurrentsize;j++){

m_elements[j]=m_elements[j+1];

}

m_ncurrentsize--;

continue;

}

i++;

}

if(size==m_ncurrentsize){

cout<<"can't find the element you want to remove"<<endl;

return 0;

}

return 1;

}

template <typename Type> void SeqList<Type>::Print(){

for(int i=0;i<=m_ncurrentsize;i++)

cout<<i+1<<":\t"<<m_elements[i]<<endl;

cout<<endl<<endl;

}

Test.cpp

#include <iostream>

#include "SeqList.h"

using namespace std;

int main()

{

SeqList<int> test(15);

int array[15]={2,5,8,1,9,9,7,6,4,3,2,9,7,7,9};

for(int i=0;i<15;i++){

test.Insert(array[i],0);

}

test.Insert(1,0);

cout<<(test.Find(0)?"can't be found ":"Be found ")<< 0 << endl<<endl;

test.Remove(7);

test.Print();

test.Remove(9);

test.Print();

test.Remove(0);

test.Print();

return 0;

}

2、单链表

ListNode.h

template<typename Type> class SingleList;

template<typename Type> class ListNode{

private:

friend typename SingleList<Type>;

ListNode():m_pnext(NULL){}

ListNode(const Type item,ListNode<Type> *next=NULL):m_data(item),m_pnext(next){}

~ListNode(){

m_pnext=NULL;

}

public:

Type GetData();

friend ostream& operator<< <Type>(ostream& ,ListNode<Type>&);

private:

Type m_data;

ListNode *m_pnext;

};

template<typename Type> Type ListNode<Type>::GetData(){

return this->m_data;

}

template<typename Type> ostream& operator<<(ostream& os,ListNode<Type>& out){

os<<out.m_data;

return os;

}

SingleList.h

#include "ListNode.h"

template<typename Type> class SingleList{

public:

SingleList():head(new ListNode<Type>()){}

~SingleList(){

MakeEmpty();

delete head;

}

public:

void MakeEmpty(); //make the list empty

int Length(); //get the length

ListNode<Type> *Find(Type value,int n); //find thd nth data which is equal to value

ListNode<Type> *Find(int n); //find the nth data

bool Insert(Type item,int n=0); //insert the data in the nth position

Type Remove(int n=0); //remove the nth data

bool RemoveAll(Type item); //remove all the data which is equal to item

Type Get(int n); //get the nth data

void Print(); //print the list

private:

ListNode<Type> *head;

};

template<typename Type> void SingleList<Type>::MakeEmpty(){

ListNode<Type> *pdel;

while(head->m_pnext!=NULL){

pdel=head->m_pnext;

head->m_pnext=pdel->m_pnext;

delete pdel;

}

template<typename Type> int SingleList<Type>::Length(){

ListNode<Type> *pmove=head->m_pnext;

int count=0;

while(pmove!=NULL){

pmove=pmove->m_pnext;

count++;

}

return count;

}

template<typename Type> ListNode<Type>* SingleList<Type>::Find(int n){

if(n<0){

cout<<"The n is out of boundary"<<endl;

return NULL;

}

ListNode<Type> *pmove=head->m_pnext;

for(int i=0;i<n&&pmove;i++){

pmove=pmove->m_pnext;

}

if(pmove==NULL){

cout<<"The n is out of boundary"<<endl;

return NULL;

}

return pmove;

}

template<typename Type> ListNode<Type>* SingleList<Type>::Find(Type value,int n){

if(n<1){

cout<<"The n is illegal"<<endl;

return NULL;

}

ListNode<Type> *pmove=head;

int count=0;

while(count!=n&&pmove){

pmove=pmove->m_pnext;

if(pmove->m_data==value){

count++;

}

if(pmove==NULL){

cout<<"can't find the element"<<endl;

return NULL;

}

return pmove;

}

template<typename Type> bool SingleList<Type>::Insert(Type item, int n){

if(n<0){

cout<<"The n is illegal"<<endl;

return 0;

}

ListNode<Type> *pmove=head;

ListNode<Type> *pnode=new ListNode<Type>(item);

if(pnode==NULL){

cout<<"Application error!"<<endl;

return 0;

}

for(int i=0;i<n&&pmove;i++){

pmove=pmove->m_pnext;

}

if(pmove==NULL){

cout<<"the n is illegal"<<endl;

return 0;

}

pnode->m_pnext=pmove->m_pnext;

pmove->m_pnext=pnode;

return 1;

}

template<typename Type> bool SingleList<Type>::RemoveAll(Type item){

ListNode<Type> *pmove=head;

ListNode<Type> *pdel=head->m_pnext;

while(pdel!=NULL){

if(pdel->m_data==item){

pmove->m_pnext=pdel->m_pnext;

delete pdel;

pdel=pmove->m_pnext;

continue;

}

pmove=pmove->m_pnext;

pdel=pdel->m_pnext;

}

return 1;

}

template<typename Type> Type SingleList<Type>::Remove(int n){

if(n<0){

cout<<"can't find the element"<<endl;

exit(1);

}

ListNode<Type> *pmove=head,*pdel;

for(int i=0;i<n&&pmove->m_pnext;i++){

pmove=pmove->m_pnext;

}

if(pmove->m_pnext==NULL){

cout<<"can't find the element"<<endl;

exit(1);

}

pdel=pmove->m_pnext;

pmove->m_pnext=pdel->m_pnext;

Type temp=pdel->m_data;

delete pdel;

return temp;

}

template<typename Type> Type SingleList<Type>::Get(int n){

if(n<0){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

ListNode<Type> *pmove=head->m_pnext;

for(int i=0;i<n;i++){

pmove=pmove->m_pnext;

if(NULL==pmove){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

return pmove->m_data;

}

template<typename Type> void SingleList<Type>::Print(){

ListNode<Type> *pmove=head->m_pnext;

cout<<"head";

while(pmove){

cout<<"--->"<<pmove->m_data;

pmove=pmove->m_pnext;

}

cout<<"--->over"<<endl<<endl<<endl;

}

test.cpp

#include <iostream>

using namespace std;

#include "SingleList.h"

int main()

{

SingleList<int> list;

for(int i=0;i<20;i++){

list.Insert(i*3,i);

}

for(int i=0;i<5;i++){

list.Insert(3,i*3);

}

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

list.Remove(5);

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

list.RemoveAll(3);

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

cout<<"The third element is "<<list.Get(3)<<endl;

cout<<*list.Find(18,1)<<endl;

list.Find(100);

list.MakeEmpty();

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

return 0;

}

3、双向链表

NodeList.h

template<typename Type> class DoublyList;

template<typename Type> class ListNode{

private:

friend class DoublyList<Type>;

ListNode():m_pprior(NULL),m_pnext(NULL){}

ListNode(const Type item,ListNode<Type> *prior=NULL,ListNode<Type> *next=NULL)

:m_data(item),m_pprior(prior),m_pnext(next){}

~ListNode(){

m_pprior=NULL;

m_pnext=NULL;

}

public:

Type GetData();

private:

Type m_data;

ListNode *m_pprior;

ListNode *m_pnext;

};

template<typename Type> Type ListNode<Type>::GetData(){

return this->m_data;

}

DoubleList.h

#include "ListNode.h"

template<typename Type> class DoublyList{

public:

DoublyList():head(new ListNode<Type>()){ //the head node point to itself

head->m_pprior=head;

head->m_pnext=head;

}

~DoublyList(){

MakeEmpty();

delete head;

}

public:

void MakeEmpty(); //make the list empty

int Length(); //get the length of the list

ListNode<Type> *Find(int n=0); //find the nth data

ListNode<Type> * FindData(Type item); //find the data which is equal to item

bool Insert(Type item,int n=0); //insert item in the nth data

Type Remove(int n=0); //delete the nth data

Type Get(int n=0); //get the nth data

void Print(); //print the list

private:

ListNode<Type> *head;

};

template<typename Type> void DoublyList<Type>::MakeEmpty(){

ListNode<Type> *pmove=head->m_pnext,*pdel;

while(pmove!=head){

pdel=pmove;

pmove=pdel->m_pnext;

delete pdel;

}

head->m_pnext=head;

head->m_pprior=head;

}

template<typename Type> int DoublyList<Type>::Length(){

ListNode<Type> *pprior=head->m_pprior,*pnext=head->m_pnext;

int count=0;

while(1){

if(pprior->m_pnext==pnext){

break;

}

if(pprior==pnext&&pprior!=head){

count++;

break;

}

count+=2;

pprior=pprior->m_pprior;

pnext=pnext->m_pnext;

}

return count;

}

template<typename Type> ListNode<Type>* DoublyList<Type>::Find(int n = 0){

if(n<0){

cout<<"The n is out of boundary"<<endl;

return NULL;

}

ListNode<Type> *pmove=head->m_pnext;

for(int i=0;i<n;i++){

pmove=pmove->m_pnext;

if(pmove==head){

cout<<"The n is out of boundary"<<endl;

return NULL;

}

return pmove;

}

template<typename Type> bool DoublyList<Type>::Insert(Type item,int n){

if(n<0){

cout<<"The n is out of boundary"<<endl;

return 0;

}

ListNode<Type> *newnode=new ListNode<Type>(item),*pmove=head;

if(newnode==NULL){

cout<<"Application Erorr!"<<endl;

exit(1);

}

for(int i=0;i<n;i++){ //find the position for insert

pmove=pmove->m_pnext;

if(pmove==head){

cout<<"The n is out of boundary"<<endl;

return 0;

}

//insert the data

newnode->m_pnext=pmove->m_pnext;

newnode->m_pprior=pmove;

pmove->m_pnext=newnode;

newnode->m_pnext->m_pprior=newnode;

return 1;

}

template<typename Type> Type DoublyList<Type>::Remove(int n = 0){

if(n<0){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

ListNode<Type> *pmove=head,*pdel;

for(int i=0;i<n;i++){ //find the position for delete

pmove=pmove->m_pnext;

if(pmove==head){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

//delete the data

pdel=pmove;

pmove->m_pprior->m_pnext=pdel->m_pnext;

pmove->m_pnext->m_pprior=pdel->m_pprior;

Type temp=pdel->m_data;

delete pdel;

return temp;

}

template<typename Type> Type DoublyList<Type>::Get(int n = 0){

if(n<0){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

ListNode<Type> *pmove=head;

for(int i=0;i<n;i++){

pmove=pmove->m_pnext;

if(pmove==head){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

return pmove->m_data;

}

template<typename Type> void DoublyList<Type>::Print(){

ListNode<Type> *pmove=head->m_pnext;

cout<<"head";

while(pmove!=head){

cout<<"--->"<<pmove->m_data;

pmove=pmove->m_pnext;

}

cout<<"--->over"<<endl<<endl<<endl;

}

template<typename Type> ListNode<Type>* DoublyList<Type>::FindData(Type item){

ListNode<Type> *pprior=head->m_pprior,*pnext=head->m_pnext;

while(pprior->m_pnext!=pnext && pprior!=pnext){ //find the data in the two direction

if(pprior->m_data==item){

return pprior;

}

if(pnext->m_data==item){

return pnext;

}

pprior=pprior->m_pprior;

pnext=pnext->m_pnext;

}

cout<<"can't find the element"<<endl;

return NULL;

}

Test.cpp

#include <iostream>

#include "DoublyList.h"

using namespace std;

int main()

{

DoublyList<int> list;

for(int i=0;i<20;i++){

list.Insert(i*3,i);

}

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

for(int i=0;i<5;i++){

list.Insert(3,i*3);

}

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

list.Remove(5);

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

cout<<list.FindData(54)->GetData()<<endl;

cout<<"The third element is "<<list.Get(3)<<endl;

list.MakeEmpty();

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

return 0;

}

4、循环链表

ListNode.h

template<typename Type> class CircularList;

template<typename Type> class ListNode{

private:

friend class CircularList<Type>;

ListNode():m_pnext(NULL){}

ListNode(const Type item,ListNode<Type> *next=NULL):m_data(item),m_pnext(next){}

~ListNode(){

m_pnext=NULL;

}

private:

Type m_data;

ListNode *m_pnext;

};

CircularList.h

#include "ListNode.h"

template<typename Type> class CircularList{

public:

CircularList():head(new ListNode<Type>()){

head->m_pnext=head;

}

~CircularList(){

MakeEmpty();

delete head;

}

public:

void MakeEmpty(); //clear the list

int Length(); //get the length

ListNode<Type> *Find(Type value,int n); //find the nth data which is equal to value

ListNode<Type> *Find(int n); //find the nth data

bool Insert(Type item,int n=0); //insert the data into the nth data of the list

Type Remove(int n=0); //delete the nth data

bool RemoveAll(Type item); //delete all the datas which are equal to value

Type Get(int n); //get the nth data

void Print(); //print the list

private:

ListNode<Type> *head;

};

template<typename Type> void CircularList<Type>::MakeEmpty(){

ListNode<Type> *pdel,*pmove=head;

while(pmove->m_pnext!=head){

pdel=pmove->m_pnext;

pmove->m_pnext=pdel->m_pnext;

delete pdel;

}

template<typename Type> int CircularList<Type>::Length(){

ListNode<Type> *pmove=head;

int count=0;

while(pmove->m_pnext!=head){

pmove=pmove->m_pnext;

count++;

}

return count;

}

template<typename Type> ListNode<Type>* CircularList<Type>::Find(int n){

if(n<0){

cout<<"The n is out of boundary"<<endl;

return NULL;

}

ListNode<Type> *pmove=head->m_pnext;

for(int i=0;i<n&&pmove!=head;i++){

pmove=pmove->m_pnext;

}

if(pmove==head){

cout<<"The n is out of boundary"<<endl;

return NULL;

}

return pmove;

}

template<typename Type> ListNode<Type>* CircularList<Type>::Find(Type value,int n){

if(n<1){

cout<<"The n is illegal"<<endl;

return NULL;

}

ListNode<Type> *pmove=head;

int count=0;

while(count!=n){

pmove=pmove->m_pnext;

if(pmove->m_data==value){

count++;

}

if(pmove==head){

cout<<"can't find the element"<<endl;

return NULL;

}

return pmove;

}

template<typename Type> bool CircularList<Type>::Insert(Type item, int n){

if(n<0){

cout<<"The n is out of boundary"<<endl;

return 0;

}

ListNode<Type> *pmove=head;

ListNode<Type> *pnode=new ListNode<Type>(item);

if(pnode==NULL){

cout<<"Application error!"<<endl;

exit(1);

}

for(int i=0;i<n;i++){

pmove=pmove->m_pnext;

if(pmove==head){

cout<<"The n is out of boundary"<<endl;

return 0;

}

pnode->m_pnext=pmove->m_pnext;

pmove->m_pnext=pnode;

return 1;

}

template<typename Type> bool CircularList<Type>::RemoveAll(Type item){

ListNode<Type> *pmove=head;

ListNode<Type> *pdel=head->m_pnext;

while(pdel!=head){

if(pdel->m_data==item){

pmove->m_pnext=pdel->m_pnext;

delete pdel;

pdel=pmove->m_pnext;

continue;

}

pmove=pmove->m_pnext;

pdel=pdel->m_pnext;

}

return 1;

}

template<typename Type> Type CircularList<Type>::Remove(int n){

if(n<0){

cout<<"can't find the element"<<endl;

exit(1);

}

ListNode<Type> *pmove=head,*pdel;

for(int i=0;i<n&&pmove->m_pnext!=head;i++){

pmove=pmove->m_pnext;

}

if(pmove->m_pnext==head){

cout<<"can't find the element"<<endl;

exit(1);

}

pdel=pmove->m_pnext;

pmove->m_pnext=pdel->m_pnext;

Type temp=pdel->m_data;

delete pdel;

return temp;

}

template<typename Type> Type CircularList<Type>::Get(int n){

if(n<0){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

ListNode<Type> *pmove=head->m_pnext;

for(int i=0;i<n;i++){

pmove=pmove->m_pnext;

if(pmove==head){

cout<<"The n is out of boundary"<<endl;

exit(1);

}

return pmove->m_data;

}

template<typename Type> void CircularList<Type>::Print(){

ListNode<Type> *pmove=head->m_pnext;

cout<<"head";

while(pmove!=head){

cout<<"--->"<<pmove->m_data;

pmove=pmove->m_pnext;

}

cout<<"--->over"<<endl<<endl<<endl;

}

Test.cpp

#include <iostream>

#include "CircularList.h"

using namespace std;

int main()

{

CircularList<int> list;

for(int i=0;i<20;i++){

list.Insert(i*3,i);

}

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

for(int i=0;i<5;i++){

list.Insert(3,i*3);

}

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

list.Remove(5);

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

list.RemoveAll(3);

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

cout<<"The third element is "<<list.Get(3)<<endl;

list.MakeEmpty();

cout<<"the Length of the list is "<<list.Length()<<endl;

list.Print();

return 0;

}

5、顺序栈

SeqStack.h

template<typename Type> class SeqStack{

public:

SeqStack(int sz):m_ntop(-1),m_nMaxSize(sz){

m_pelements=new Type[sz];

if(m_pelements==NULL){

cout<<"Application Error!"<<endl;

exit(1);

}

~SeqStack(){

delete[] m_pelements;

}

public:

void Push(const Type item); //push data

Type Pop(); //pop data

Type GetTop() const; //get data

void Print(); //print the stack

void MakeEmpty(){ //make the stack empty

m_ntop=-1;

}

bool IsEmpty() const{

return m_ntop==-1;

}

bool IsFull() const{

return m_ntop==m_nMaxSize-1;

}

private:

int m_ntop;

Type *m_pelements;

int m_nMaxSize;

};

template<typename Type> void SeqStack<Type>::Push(const Type item){

if(IsFull()){

cout<<"The stack is full!"<<endl;

return;

}

m_pelements[++m_ntop]=item;

}

template<typename Type> Type SeqStack<Type>::Pop(){

if(IsEmpty()){

cout<<"There is no element!"<<endl;

exit(1);

}

return m_pelements[m_ntop--];

}

template<typename Type> Type SeqStack<Type>::GetTop() const{

if(IsEmpty()){

cout<<"There is no element!"<<endl;

exit(1);

}

return m_pelements[m_ntop];

}

template<typename Type> void SeqStack<Type>::Print(){

cout<<"bottom";

for(int i=0;i<=m_ntop;i++){

cout<<"--->"<<m_pelements[i];

}

cout<<"--->top"<<endl<<endl<<endl;

}

Test.cpp

#include<iostream>

using namespace std;

#include "SeqStack.h"

int main(){

SeqStack<int> stack(10);

int init[10]={1,2,6,9,0,3,8,7,5,4};

for(int i=0;i<10;i++){

stack.Push(init[i]);

}

stack.Print();

stack.Push(88);

cout<<stack.Pop()<<endl;

stack.Print();

stack.MakeEmpty();

stack.Print();

stack.Pop();

return 0;

}

6、链式栈

StackNode.h

template<typename Type> class LinkStack;

template<typename Type> class StackNode{

private:

friend class LinkStack<Type>;

StackNode(Type dt,StackNode<Type> *next=NULL):m_data(dt),m_pnext(next){}

private:

Type m_data;

StackNode<Type> *m_pnext;

};

LinkStack.h

#include "StackNode.h"

template<typename Type> class LinkStack{

public:

LinkStack():m_ptop(NULL){}

~LinkStack(){

MakeEmpty();

}

public:

void MakeEmpty(); //make the stack empty

void Push(const Type item); //push the data

Type Pop(); //pop the data

Type GetTop() const; //get the data

void Print(); //print the stack

bool IsEmpty() const{

return m_ptop==NULL;

}

private:

StackNode<Type> *m_ptop;

};

template<typename Type> void LinkStack

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

跟导师请教后写出的关于C#导出Excel，不导出隐藏列的方法发布时间：2022-07-14

C#——操作Word并导出PDF发布时间：2022-07-14

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

2023-10-27

florent37/ViewAnimator: A fluent Android

2022-08-15

florent37/Shrine-MaterialDesign2: implem

2022-08-17

CVE-2020-36276

2022-09-23

SimpleSoftwareIO/simple-sms: Send and re

2022-08-13

阅读排行榜

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：17965|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9566|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8128|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8510|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8413|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9307|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8377|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7809|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8361|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7361|2022-11-06

客服电话

电子邮件

摘：数据结构各种算法实现(C++模板)

目 录

1、顺序表

Seqlist.h

Test.cpp

2、 单链表

ListNode.h

SingleList.h

test.cpp

3、 双向链表

NodeList.h

DoubleList.h

Test.cpp

4、 循环链表

ListNode.h

CircularList.h

Test.cpp

5、 顺序栈

SeqStack.h

Test.cpp

6、 链式栈

StackNode.h

LinkStack.h

请发表评论

全部评论

上一篇：

下一篇：

librespeed/speedtest: Self-hosted Speedt

avehtari/BDA_m_demos: Bayesian Data Anal

四维彩超怎么看性别？四维看男孩女孩诀窍

medfreeman/markdown-it-toc-and-anchor: m

CVE-2022-35234

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053

目录

2、单链表

3、双向链表

4、循环链表

5、顺序栈

6、链式栈