代码搜索：SqStack
找到约 774 项符合「SqStack」的源代码
代码结果 774
www.eeworm.com/read/262111/11606039
cpp bo3-1.cpp
// bo3-1.cpp 顺序栈（存储结构由c3-1.h定义）的基本操作（9个）
Status InitStack(SqStack &S)
{ // 构造一个空栈S
if(!(S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType))))
exit(OVERFLOW); // 存储分配失败
S.t
www.eeworm.com/read/157758/11665922
cpp 复件 kuohao.cpp
#include
using namespace std;
#define ERROR 0
#define OK 1
#define SIZE 8
#define OVERFLOW -1
#define CRMENT 4
typedef char SElemtype;
typedef char Elemtype;
typedef int status;
t
www.eeworm.com/read/260947/11684713
cpp 6_56.cpp
#include
struct sqstack
{
char data;
sqstack* top;
};
class stack
{
sqstack * st;
public:
void init()
{
st=NULL;
}
void push(char );
char pop();
};
void stack::p
www.eeworm.com/read/260947/11684949
cpp 6_57.cpp
#include
#include
struct sqstack
{
char data;
sqstack* top;
};
class stack
{
sqstack * st;
public:
void init()
{
st=NULL;
}
void push(char );
char pop()
www.eeworm.com/read/257001/11961452
c file.c
#include"sc.h"
#include"han.c"
void main()
{
int v=1,w=3;
int x,y;
sqstack s;
InitStack(&s);
push(&s,v,w);
pop(&s,&x,&y);
printf("%d %d\n",x,y);
}
www.eeworm.com/read/341126/12105680
txt maze.txt
#include
#include
int Maze[6][6]={1,1,1,1,1,1,1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,1,1,1};
typedef struct{
int x;
int y;
int di;
}postype;
typedef
www.eeworm.com/read/254894/12114142
cpp 4.cpp
#include
#include
#include
#include
#include
#include
#include
/*#include */
#define ST 110;
www.eeworm.com/read/254457/12135648
cpp 4--数据结构－停车场管理程序.cpp
#include
#include
#include
#define N 2 //--------停车场容量----------------
#define M 0.05 //---
www.eeworm.com/read/151532/12203284
txt stack_c.txt
#include
#include
#include
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define OK 1
#define Status int
#define EQUAL 1
#define OVERFLOW -1
#define STACK_INIT