代码搜索：InitStack
找到约 954 项符合「InitStack」的源代码
代码结果 954
www.eeworm.com/read/359985/10112735
cpp function.cpp
//Function.cpp
Status InitStack(SqStack &S) // 构造一个空栈S
{
S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!S.base)
exit(OVERFLOW);
S.top=S.base;
S.stacksize=STAC
www.eeworm.com/read/439490/7707588
c a2stack.c
/* Bai tap 3_67 - Quan ly hai STACK chi dung 1 day */
#include
#include
#include
#define MAX 100
int stack[2*MAX];
int top1, top2;
void initstack()
{
to
www.eeworm.com/read/197075/8032441
cpp 主函数.cpp
#include"SqStack.h"
void main(){
SqStack sq;SElemType e;
InitStack(sq);
char str[30];
cout
www.eeworm.com/read/309884/13662843
cpp stack.cpp
//stack.c
#include "stdafx.h"
#include "global.h"
int InitStack(intstack &S)
{
S.base=(int*)malloc(STACK_INIT_SIZE*sizeof(int));
if(!S.base)exit(OVERFLOW);
S.top=S.base;
S.stacksize =STA
www.eeworm.com/read/368258/6348836
c stack.c
// file: stack.c
#include "stack.h"
#include "malloc.h"
#include "string.h"
// 构造一个空栈
bool InitStack(SqStack *S, uint8 elemsize)
{
S->base = (byte *)malloc(STACK_INIT_SIZE* elemsize);
www.eeworm.com/read/118975/14846089
h wdf2.h
#include"wdf1.h"
#include
int InitStack(stack &s)
{
s.base=(int *)malloc(100*sizeof(int));
if(!s.base ) exit(0);
s.top=s.base;
s.stacksize=100;
return 1;
}
int destroystack(s
www.eeworm.com/read/195829/5107221
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
www.eeworm.com/read/303129/3815411
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
www.eeworm.com/read/294906/3914708
c postordertraverse.c
Status PostOrderTraverse(BiTree T,Status(*Visit)(TElemType e)){
//后序遍历二叉树的非递归算法，对每个元素调用函数Visit
BiTree p = T,q = NULL;
SqStack S; InitStack(S); Push(S,p);
while (!StackEmpty(S)){
www.eeworm.com/read/294906/3914715
c preordertraverse.c
Status PreOrderTraverse(BiTree T,Status(*Visit)(TElemType e)){
//前序遍历二叉树的非递归算法，对每个元素调用函数Visit
InitStack(S); p = T;
while(p || !StackEmpty(S)){
if(p){
if(!Visit(p->data)){
return ERR