代码搜索：SqStack
找到约 774 项符合「SqStack」的源代码
代码结果 774
www.eeworm.com/read/161836/10366729
txt 迷宫求解.txt
definition.h
========================================================
#define INIT_SIZE 100 //存储空间初始分配量
#define INCREMENT 10 //存储空间分配增量
typedef struct{
unsigned ord, x, y; //通道块在路径上的“序号”，通道快在迷
www.eeworm.com/read/161836/10366745
txt 括号匹配.txt
definition
===========================
#define INIT_SIZE 100 //存储空间初始分配量
#define INCREMENT 10 //存储空间分配增量
typedef char ElemType;
typedef struct{
ElemType *top, *base; //栈顶指针和栈底指针
unsigned s
www.eeworm.com/read/161836/10366756
txt 二叉树.txt
definition.h
=========================================
#define INIT_SIZE 100 //存储空间初始分配量
#define INCREMENT 10 //存储空间分配增量
typedef char TElemType;
typedef struct{
TElemType data;
struct BiTN
www.eeworm.com/read/161836/10366765
txt 堆栈的基本操作.txt
definition.h
=================================================
#define INIT_SIZE 100 //存储空间初始分配量
#define INCREMENT 10 //存储空间分配增量
typedef char ElemType;
typedef struct{
ElemType *top, *base;
www.eeworm.com/read/425218/10369462
c ch3_express.c
/*
栈的应用：表达式计算
author: kk.h
date: 2006.9
http://www.cocoon.org.cn
*/
#include "stdio.h"
#define StackSize 100
typedef int ElemType;
typedef struct {
ElemType elem[StackSize];
int top;
www.eeworm.com/read/425218/10369473
c ch3_sstack.c
/*
栈的顺序实现
author: kk.h
date: 2006.9
http://www.cocoon.org.cn
*/
#include "stdio.h"
#define StackSize 100
typedef int ElemType;
typedef struct {
ElemType elem[StackSize];
int top;
}Sq
www.eeworm.com/read/353894/10407547
i+
#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/423304/10571948
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/159770/10618621
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/351570/10639321
cpp algo0301.cpp
void conversion (int Num) { // 算法3.1
// 对于输入的任意一个非负十进制整数，打印输出与其等值的八进制数
ElemType e;
SqStack S;
InitStack(S); // 构造空栈
while (Num) {
Push(S, Num % 8);
N