摘要： #include<iostream.h>#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef char ElemType;const int MaxSize=11; //静态链表大小typedef struct node{ //静态链表结点 ElemType data; int cur;}SNode,SLinkList[MaxSize];void Visit_SL(SLinkList,int);//int Unused;//空闲静态链表头指针void In... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h>#define LIST_INIT_SIZE 100#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef int ElemType;typedef struct LNode{ ElemType data; //数据域 struct LNode *next; //指针域}LNode,*LinkList;Status InitList_L(LinkList &L){... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h>#define LIST_INIT_SIZE 100#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef int ElemType;typedef struct LNode{ ElemType data; //数据域 struct LNode *next; //指针域}LNode,*LinkList;Status InitList_L(LinkList &L){... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h>#define LIST_INIT_SIZE 100#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef int ElemType;typedef struct{ ElemType *elem; int length; //当前长度 int listsize; //当前分配的存储容量}SqList;Status InitList_Sq(SqList &L){ //构... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h>#define LIST_INIT_SIZE 100#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef int ElemType;typedef struct{ ElemType *elem; int length; //当前长度 int listsize; //当前分配的存储容量}SqList;Status InitList_Sq(SqList &L){ //构... 阅读全文

摘要： #include<iostream.h>#include<stdlib.h>#define LIST_INIT_SIZE 100#define OK 1#define OVERFLOW -2#define ERROR 0typedef int Status;typedef int ElemType;typedef struct{ ElemType *elem; int length; //当前长度 int listsize; //当前分配的存储容量}SqList;Status InitList_Sq(SqList &L){ //构... 阅读全文

摘要： 1 #include<iostream.h> 2 #include<stdlib.h> 3 #define LIST_INIT_SIZE 100 4 #define OK 1 5 #define OVERFLOW -2 6 #define ERROR 0 7 typedef int Status; 8 9 typedef int ElemType; 10 typedef struct 11 { 12 ElemType *elem; 13 int length; 14 int listsize; 15 }SqList; 16 ... 阅读全文

摘要： 哈哈，终于有了IT博客了 阅读全文