代码搜索:SqStack

找到约 774 项符合「SqStack」的源代码

代码结果 774
www.eeworm.com/read/335076/12550894

c check_st.c

#include //#include #include #define OK 1 #define TRUE 1 #define FALSE 0 #define ERROR 0 #define OVERFLOW -2 #define STACK_INIF_SIZE 40 #define STACKINCREMENT 10
www.eeworm.com/read/300816/13891526

h maze.h

struct PosType //定义迷宫坐标位置的类型 { int x; //行值 int y; //列值 }; # define MAXLENGTH 30 //假设迷宫的最大行列数为30(包括外围的墙) typedef int MazeType[MAXLENGTH][MAXLENG
www.eeworm.com/read/133290/14049328

h stack.h

#include "malloc.h" #define STACK_INT_SIZE 100; #define STACKINCREMENT 10; #define OK 1; #define OVERFLOW 0; #define ERROR 0; typedef int SElemType; typedef bool Status; typedef struct{
www.eeworm.com/read/133132/14053998

cpp 5.cpp

//5.后序遍历的非递归算法 #define STACK_INIT_SIZE 100//存储空间初始分量 #define STACKINCREMENT 10//存储空间分配增量 #include #include #include typedef struct BTNode { //定义树的存储结构 ch
www.eeworm.com/read/235539/14064812

cpp bo3-1.cpp

// bo3-1.cpp 顺序栈(存储结构由c3-1.h定义)的基本操作(9个) void InitStack(SqStack &S) { // 构造一个空栈S if(!(S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType)))) exit(OVERFLOW); // 存储分配失败 S.top
www.eeworm.com/read/235539/14064896

cpp bo3-1.cpp

// bo3-1.cpp 顺序栈(存储结构由c3-1.h定义)的基本操作(9个) void InitStack(SqStack &S) { // 构造一个空栈S if(!(S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType)))) exit(OVERFLOW); // 存储分配失败 S.top
www.eeworm.com/read/106800/15621249

h c3-1.h

// c3-1.h 栈的顺序存储表示 #define STACK_INIT_SIZE 10 // 存储空间初始分配量 #define STACKINCREMENT 2 // 存储空间分配增量 struct SqStack { SElemType *base; // 在栈构造之前和销毁之后,base的值为NULL SElemType *top; // 栈顶指针
www.eeworm.com/read/106800/15621455

h c3-1.h

/* c3-1.h 栈的顺序存储表示 */ #define STACK_INIT_SIZE 10 /* 存储空间初始分配量 */ #define STACKINCREMENT 2 /* 存储空间分配增量 */ typedef struct SqStack { SElemType *base; /* 在栈构造之前和销毁之后,base的值为NULL */ SElemT
www.eeworm.com/read/105295/15671586

h stack.h

#include "iostream.h" #include "stdio.h" #include "malloc.h" #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVERFLOW -2 typedef char Status;
www.eeworm.com/read/103549/15729445

cpp 栈的数制转换算法.cpp

#include #include #include #define OVERFLOW -1 #define STACK_INIT_SIZE 100 #define STACKINCREMENT 10 typedef int SElemType; typedef int Status; struct STACK