摘要：栈的基本操作 1 #include <stdio.h> 2 #include <stdlib.h> 3 4 #define StackSize 100 5 #define Sizeincrease 10 6 7 typedef int SElemtype; 8 typedef struct{ 9 SElemtype *base;10 SElemtype *top;11 int stacksize;12 }SqStack;13 SElemtype e;14 15 SElemtype Initial(SqStack &S)16 {17 S.base=(SElem.. 阅读全文

摘要：#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100#define LISTINCREMENT 10#define SWAP(x,y) {t=x,x=y,y=t;}typedef int ElemType;typedef int Status;typedef struct LNode { ElemType d 阅读全文

摘要：#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100#define LISTINCREMENT 10typedef int Status;typedef int ElemType;typedef struct{ ElemType *elem; int length; int listsize;}SqList; 阅读全文