代码搜索：InitStack

找到约 954 项符合「InitStack」的源代码

代码结果 954
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/360652/2960759

txt 算法 4.4.txt

算法 4.4 double evaluation( char suffix[] ){ // 本函数返回由后缀式suffix表示的表达式的运算结果 ch = *suffix++; InitStack(S); // 设置空栈S while ( ch != 2#2 ) { if (!OpMember(ch)) Push(S, c
·
www.eeworm.com/read/182642/6840475

cpp bintree.cpp

#include #include #include #include "BinTree.h" //二叉树类的构造函数 BinTree::BinTree() { //初始化成员变量 S = new SeqStack; Q = new LinkQueue; InitStack(S); InitQue
·
www.eeworm.com/read/368255/9703719

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/368254/9703733

c stack.c

// file: stack.c #include "stack.h" #include "malloc.h" // 构造一个空栈 bool InitStack(SqStack *S) { S->base = (SELEM_TYPE *)malloc(STACK_INIT_SIZE* sizeof(SELEM_TYPE)); if (!S->base)
·
www.eeworm.com/read/134761/13974530

c kuahao.c

#include typedef struct {char date[20]; int top; }stack; void initstack(stack *s) /*清空站；*/ {s->top=-1; } int stackempty(stack *s) /*判断站是否为空，为空返回1，否则返回0。*/ {if(s->
·
www.eeworm.com/read/191798/8422073

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[L]; size=0; }
·
www.eeworm.com/read/283541/9010817

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" #include //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[
·
www.eeworm.com/read/380114/9163495

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[L]; size=0; }
·
www.eeworm.com/read/183295/9171469

cpp linearstack2.cpp

// 链式堆栈的实现linearStack2.cpp #include "linearStack2.h" #include //构造函数 LinStack::LinStack() {top=NULL;size=0;} //初始化栈,分配存储空间并置空 void LinStack::InitStack(int L) {top=new StackNode[
·
www.eeworm.com/read/176423/9499150

cpp 3_huiwen.cpp

//回文游戏； #include #include struct stack{//定义堆栈 char * base; char * top; int stacksize; }; void InitStack(stack &s){//构造一个空栈 s.base=new char(40); s.top=s.b
·