leafinsnowfield的专栏

#ifndef _LINKQUEUE_H_#define _LINKQUEUE_H_#include "Node.h"#include using namespace std;enum StatusCode{UNDER_FLOW,SUCCESS};templateclass LinkQueue{ protected: Node *rear,*front; void

#ifndef _SQSTACK_H_#define _SQSTACK_H_#include using namespace std;enum StatusCode{SUCCESS,RANGE_ERROR,OVER_FLOW,UNDER_FLOW};const int DEFAULT_SIZE=10;templateclass SqStack{ protected: int

#ifndef _SIMPLEDBLLINKLIST_H_#define _SIMPLEDBLLINKLIST_H_#include #include "NodeDbl.h"using namespace std;enum StatusCode{SUCCESS,RANGE_ERROR};templateclass SimpleDblLinkList{ protected:

注意1在getElemPtr的时候的position的范围是0到Length（）2在约瑟夫循环中应为出去的位置是position-1而出去了之后紧接着原来的元素位置被后面一个元素补上，所以position—1的位置#include #include "Node.h"#include "SimpleCircLinkList.h"using namespace std;void J

#ifndef _SIMPLELINKLIST_H_#define _SIMPLELINKLIST_H_#include "Node.h"using namespace std;enum StatusCode{SUCCESS,RANGE_ERROR};templateclass SimpleLinkList{ protected: Node *head; void

#ifndef _NODE_H_#define _NODE_H_#include using namespace std;templateclass Node{ public: ElemType data; Node *next; Node(); Node(ElemType e,Node* link=NULL); //Node(ElemType e,Node*

#include using namespace std;int KMPIndexHelp(const string &T,const string &P,int pos,int next[]){ int i=pos,j=0; while(i<T.length()&&j<P.length()) { // cout<<"111"<<endl; if(j==-1) { i

//#include "SqList.h"#includeusing namespace std;const int Default=20;enum StatusCode{SUCCESS,RANGE_ERROR,OVER_FLOW};templateclass SqList{ protected: int count; int maxSize; ElemType *pt

#ifndef _MATRIX_H_#define _MATRIX_H_#include using namespace std;templateclass Matrix{ protected: ElemType *elems; int rows,cols; public: Matrix(int rs,int cs); void SetMatrix(const

#include using namespace std;int FrontRearIndex(const string &T,const string &P,int pos=0){ int startPos=pos; while(startPos<T.length()-P.length()+1) { int front=0,rear=P.length()-1; while(

#ifndef _SQLIST_H_#define _SQLIST_H_#include using namespace std;const DEFAULT_SIZE=10;enum StatusCode{RANGE_ERROR,SUCCESS,NOT_PRESENT,ENTRY_FOUND,OVER_FLOW};templateclass SqList{protected:

注意：1模板类中的函数有const，那么定义此函数时const必须要有2定义模板类的函数时，template一定要有class#ifndef _SQLIST_H_//SqList.h#define _SQLIST_H_#include const DEFAULT_SIZE=10;enum StatusCode{RANGE_ERROR,SUCCESS,NOT_PRESENT,ENT

#include #include "Node.h"#include "SimpleLinkStack.h"using namespace std;bool Merg(char *s){ char tmpsChar; SimpleLinkStack la; for(int i=0;i<strlen(s);i++) { if(s[i]=='('||s[i]=='['||s[i

#include using namespace std;int SimpleIndex(const string &T,const string &P,int pos=0){ int i=pos,j=0; while(i<T.length()&&j<P.length()) { if(T[i]==P[j]) { i++; j++; }else { i

#include "SqQueue.h"#include using namespace std;void main(){ SqQueue a; a.InQueue(5); int elem; a.GetHead(elem); cout<<elem<<endl; a.InQueue(6); cout<<a.Length()<<endl; a.OutQueue(elem);

//mytree.h#pragma oncetypedef int ElemType;#ifndef _MYTREE_H_#define _MYTREE_H_struct TreeNode;typedef struct TreeNode *SearchTree;typedef struct TreeNode *Position;void MakeEmpty(SearchTree