代码搜索：SqStack
找到约 774 项符合「SqStack」的源代码
代码结果 774
www.eeworm.com/read/335076/12550913
c check_if_1.c
#include
#include
#include
//#include
#include
#define MAX 13
#define OK 1
#define TRUE 1
#define FALSE 0
#define ERROR 0
//#define OVERFLOW -2
www.eeworm.com/read/147297/12570328
c 二叉树的各种遍历操作(非)递归.c
/*二叉树的各种遍历操作*/
//#include
#include
#include
#include
/*函数结果状态代码*/
#define True 1
#define False 0
#define Ok 1
#define Err
www.eeworm.com/read/292164/8371806
c operation.c
#include "global.h"
//表达式的计算
void operate(SqStack *S,int theta)
{
int a,b,result;
b=Pop(S);
a=Pop(S);
switch(theta) {
case '+':
result=a+b; break;
case '-':
result=a-b; break;
c
www.eeworm.com/read/292164/8371812
cpp operation.cpp
#include "global.h"
void operate(SqStack *S,int theta)
{
int a,b,result;
b=Pop(S);
a=Pop(S);
switch(theta) {
case '+':
result=a+b; break;
case '-':
result=a-b; break;
case '*':
www.eeworm.com/read/292164/8371836
h global.h
/*** global.h ******************************************/
#include /*输入\输出*/
#include /*加载字符测试程序*/
#include
#include
#define BSIZE 128 /*缓冲大小*/
www.eeworm.com/read/391731/8384736
txt tingche.txt
#include "stdio.h"
#define N 2 /*停车场容量*/
#define M 5 /*停车单价*/
#define True 1
#define False 0
typedef struct{
int num; /*车牌号*/
int arrtime; /*到达/离开时间*/
www.eeworm.com/read/391456/8402996
txt 迷宫求解.txt
#define stack_init_size 200
#define overflow 0
#define ok 1
#define error 0
#include
#include
typedef int Status;
typedef struct
{
int x;
int y;
}PosType;
int
www.eeworm.com/read/290930/8450478
cpp 堆栈操作.cpp
//* * * * * * * * * * * * * * * * * * * * * * * * *
//*CHAPTER :3 (3_1) *
//*PROGRAM :堆栈操作 *
//*CONTENT :初始化,入栈,出栈,取栈顶元素 *
//*
www.eeworm.com/read/289579/8541803
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/432799/8573233
cpp expe2.cpp
#include
using namespace std;
#define elemtype char
#define NULL 0
void (* p)(elemtype);
typedef struct bitnode
{
elemtype data;
struct bitnode * lchild,* rchild;
}bitnode,* bitre