代码搜索：SqStack
找到约 774 项符合「SqStack」的源代码
代码结果 774
www.eeworm.com/read/324523/13259736
txt 栈.txt
#include "stdio.h"
#include "alloc.h"
#include "bios.h"
#include "conio.h"
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define TRUE 1
#define FALSE 0
typedef int Status;
#de
www.eeworm.com/read/136300/13383082
cpp 车厢调度.cpp
#include
#include
typedef int SElemType;
typedef int Status;
int n;//最后一个车厢的号码
long total=0;//总的组合方案数目
typedef struct stacklist
{//顺序栈定义
SElemType *base;
www.eeworm.com/read/319844/13441401
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/316977/13513266
cpp 魔王语言.cpp
#include
#include
#include
const int OK =1;
const int ERROR =0;
const int OVERFLOW =-1;
const int INIT_SIZE = 100;
const int INCREMENT = 10;
typedef char E
www.eeworm.com/read/316698/13518557
cpp 回文.cpp
#include
using namespace std;
typedef char SElemType;
typedef struct { //建立顺序栈存储结构
SElemType *base;
SElemType *top;
int stacksize;
}Sqstack;
int initsta
www.eeworm.com/read/315999/13532649
cpp bo3-1.cpp
// bo3-1.cpp 顺序栈(存储结构由c3-1.h定义)的基本操作(9个)
void InitStack(SqStack &S)
{ // 构造一个空栈S。在教科书第47页
S.base=(SElemType*)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!S.base)
exit(OVERFLOW); /
www.eeworm.com/read/315835/13535491
c 栈操作.c
#include
#include
#define MAX 20
#define ElemType int
#define S (*p)
struct SqStack
{
ElemType elem[MAX];
int top;
};
main()
{
struct SqStack *q;
int i,y,cord;
www.eeworm.com/read/315211/13548688
c 12-2.c
/*12-2.c*/
#define STACK_INIT_SIZE 100
#define STACKINCMENT 10
#define K 100
typedef struct{
selemtype *base;
selemtype *top;
int stacksize;
}sqstack;
sqstack s;
int initstac
www.eeworm.com/read/314531/13564875
cpp follow.cpp
#include"bianyi.h"
void RFollow(bool Follow[][36], const int Link[][8], const int Ruleright[][7], const bool First[][36])
{
SqStack Sqstack;
InitStack(Sqstack);
Follow[0][35]=1;
SElemTy
www.eeworm.com/read/314531/13564882
cpp zhong.cpp
#include"bianyi.h"
void yufa(const int Forecast[][36],struct Word *Hptr,const int Ruleright[][7])
{
int r(0);
int a;
SqStack Sqstack;
InitStack(Sqstack);
struct EElemType *e;