代码搜索：InitStack
找到约 954 项符合「InitStack」的源代码
代码结果 954
www.eeworm.com/read/118270/14879359
cpp 回文.cpp
//判断是否回文程序
#include
const int SM=20;
struct Stack
{
char* stack;
short top;
short StackMaxSize;
};
static void InitStack(Stack& S,int ms)
{
S.stack=new char[ms];
S.top=-1
www.eeworm.com/read/195829/5107119
c 7.11.c
int TopoSort(AdjList G)
{
Stack S;
int indegree[MAX_VERTEX_NUM];
int i,count,k;
ArcNode *p;
FindID(G,indegree); /*求各顶点入度*/
InitStack(&S); /*初始化辅助栈*/
for(i=0;i
www.eeworm.com/read/303129/3815313
c 7.11.c
int TopoSort(AdjList G)
{
Stack S;
int indegree[MAX_VERTEX_NUM];
int i,count,k;
ArcNode *p;
FindID(G,indegree); /*求各顶点入度*/
InitStack(&S); /*初始化辅助栈*/
for(i=0;i
www.eeworm.com/read/295682/8145881
c stack.c
int initstack()
{
s.base=(int *)malloc(STACK_INIT_SIZE*sizeof(int));
if(!s.base) exit(OVERFLOW);
s.top = s.base;
s.stacksize=STACK_INIT_SIZE;
return OK;
}
int gettop()
{
if(s.top
www.eeworm.com/read/294924/8192848
c stack.c
#include "stack.h"
Status InitStack(SqStack *s)
{ s->base=(Elemtype *)malloc(STACK_INIT_SIZE*sizeof(Elemtype));
if(s->base==0) return ERROR;
s->top=s->base;
//*(s->base)=0;
s->sta
www.eeworm.com/read/167250/9974365
cpp ql_hw.cpp
#include "d:\cpp\ql.cpp"
#include "d:\cpp\ss.cpp"
Bool huiwen(char con[]){
SqStack S;
LinkQueue Q;
ElemType e1,e2;
int i;
i=0;
InitStack(S);
InitQueue(Q);
while(con[i]!='\0')
www.eeworm.com/read/198320/7940302
c 习题2-括号配对检查.c
#include "datastru.h"
#include
void initstack(SEQSTACK *s)
/*顺序栈初始化*/
{ s->top = 0; }
int push(SEQSTACK *s, DATATYPE1 x)
{/*元素x入栈*/
if(s->top == MAXSIZE - 1)
{printf("
www.eeworm.com/read/327998/13052724
cpp basic.cpp
#include"Tree.h"
const int stack_init_size=200;
const int stackincrement=49;
Stack InitStack()
{
Stack S;
S.base=new memberTree*[stack_init_size];
if(!S.base)abort();
S.top=S.base;
S
www.eeworm.com/read/167250/9974362
cpp ss_khpp.cpp
#include "ss.cpp"
void Match(char a[]){
int i=0;
SqStack S;
ElemType e1,e2,e3;
InitStack(S);
printf("\n%s\n",a);
while(a[i]!='\0'){
e1=a[i];
switch(e1){
case '(':
www.eeworm.com/read/362558/9992922
h dqstack.h
#define TRUE 1
#define FALSE 0
#define M 100
typedef struct
{
StackElementType Stack[M];
StackElementType top[2]; /*top[0]和top[1]分别为两个栈顶指示器*/
}DqStack;
/*初始化操作。*/
void InitStack(DqStac