代码搜索：InitStack
找到约 954 项符合「InitStack」的源代码
代码结果 954
www.eeworm.com/read/392599/7110023
cpp stack.cpp
#include "stack.h"
#include
#include
//栈基本操作的实现
//////////////////////////////////
int InitStack(Sqstack &s)
{
s.base=(int *)malloc(Stack_init_size*sizeof(int));
if(!s.
www.eeworm.com/read/397796/8021438
c text1.c
#include"stdio.h"
status InitStack(sqstack &s,int n)
{ s.base=(LelemType)malloc(n*sizeof(elemType));
if(!s.base) exit(OVeRFLOW);
s.top=s.base;
s.stacksize=n;
retu
www.eeworm.com/read/327998/13052733
cpp statistics.cpp
#include"Tree.h"
int totalnum(memberTree * root)
{
Stack S=InitStack();
memberTree *T;
T=root;
int max=T->data;
while(T||S.base!=S.top)
{
if(T)
{
if(T->data > max)
m
www.eeworm.com/read/317251/13506833
cpp biaodashi.cpp
#include "stdio.h"
#include "stdlib.h"
#define MAX_SIZE 100
typedef struct
{
int *base;
int *top;
}SqStack;
void InitStack(SqStack &S)
{
S.base = (int *)malloc(MAX_SIZE * sizeof(int
www.eeworm.com/read/314531/13564904
cpp first.cpp
#include"bianyi.h"
void Rfirst(bool First[][36],const int Ruleright[][7],const int Link[][8])
{
SqStack Sqstack;
InitStack(Sqstack);
int Ltrace(0),Rtrace(0),Fitrace(0);
int Lptr(0),Rptr(0),F
www.eeworm.com/read/314106/13574802
cpp szzh.cpp
#include"stdio.h"
#include"stdlib.h"
#include"assert.h"
#define null 0
#define n 10
struct stack{
int *base;
int *top;
int stacksize;
};
void initstack(struct stack *s) {
s->base
www.eeworm.com/read/486816/6530378
cpp stack.cpp
#include "Operater Declare.h"
Status InitStack(SqStack &S)
{
S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!S.base)
{
exit(OVERFLOW);
}
S.top=S.base;
S.stacksi
www.eeworm.com/read/391738/8383813
h parsell_1.h
#ifndef _LL1_
#define _LL1_
#include "globals.h"
#include "scan.h"
#define MaxStackDepth 100
#include
#include
void InitStack();
/*显示符号栈中内容*/
typedef enum {ID_NUM, NO
www.eeworm.com/read/379679/9189220
cpp dazuoye1.cpp
#include
#include
#include
typedef struct{ //建立一个字符的堆栈
char *base;
char *top;
int stacksize;
}SqStack;
void InitStack(SqStack &s)
{
www.eeworm.com/read/182636/9198249
cpp stack.cpp
#include
#include "stack.h"
void InitStack(SeqStack *S)
{//将顺序栈置空
S->top = -1;
}
int StackEmpty(SeqStack *S)
{
return S->top == -1;
}
int StackFull(SeqStack *S)
{
re