代码搜索：SqStack
找到约 774 项符合「SqStack」的源代码
代码结果 774
www.eeworm.com/read/219502/14878041
cpp algo0301.cpp
void conversion (int Num) { // 算法3.1
// 对于输入的任意一个非负十进制整数，打印输出与其等值的八进制数
ElemType e;
SqStack S;
InitStack(S); // 构造空栈
while (Num) {
Push(S, Num % 8);
N
www.eeworm.com/read/117468/14919247
txt stack_c.txt
#include
#include
#include
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define OK 1
#define Status int
#define EQUAL 1
#define OVERFLOW -1
#define STACK_INIT
www.eeworm.com/read/116855/14951750
cpp bo3-1.cpp
// bo3-1.cpp 顺序栈（存储结构由c3-1.h定义）的基本操作（9个）
#include "c3-1.h"
Status InitStack(SqStack &S)
{ // 构造一个空栈S
if(!(S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType))))
exit(OVERFLOW)
www.eeworm.com/read/116426/14969711
c 12-2.c
/*12-2.c*/
#define STACK_INIT_SIZE 100
#define STACKINCMENT 10
#define K 100
typedef struct{
selemtype *base;
selemtype *top;
int stacksize;
}sqstack;
sqstack s;
int initstac
www.eeworm.com/read/114271/15062437
cpp bus2.cpp
#include
#include
const STACK_INIT_SIZE=100;
const STACKINCREMENT=10;
enum status{FALSE=0 ,ERROR=0, OVERFLOW=0,TRUE=1,OK=1};
enum status2{A=0 ,D=1};
typedef struct
{
www.eeworm.com/read/208856/15234088
cpp algo0301.cpp
void conversion (int Num) { // 算法3.1
// 对于输入的任意一个非负十进制整数，打印输出与其等值的八进制数
ElemType e;
SqStack S;
InitStack(S); // 构造空栈
while (Num) {
Push(S, Num % 8);
N
www.eeworm.com/read/475726/6776266
cpp algo0301.cpp
void conversion (int Num) { // 算法3.1
// 对于输入的任意一个非负十进制整数，打印输出与其等值的八进制数
ElemType e;
SqStack S;
InitStack(S); // 构造空栈
while (Num) {
Push(S, Num % 8);
N
www.eeworm.com/read/475822/6778867
txt 关键路径.txt
#include
using namespace std;
typedef int Status;
typedef int InfoType;
typedef int VertexType;
typedef int SElemType;
const int MAX_VERTEX_NUM=10;
const int OK=1;
const int STACK_
www.eeworm.com/read/154711/6853128
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;