代码搜索：LinkStack
找到约 226 项符合「LinkStack」的源代码
代码结果 226
www.eeworm.com/read/456942/7336443
cpp bo3-5.cpp
// bo3-5.cpp 链栈(存储结构由c2-2.h定义)的基本操作(9个)
// 大部分基本操作是由bo2-2.cpp和bo2-9.cpp中的函数改名得来
typedef SElemType ElemType; // 栈结点类型和链表结点类型一致
#include"c2-2.h"
typedef LinkList LinkStack; // LinkStack是指向栈结点的指
www.eeworm.com/read/454932/7381696
cpp bo3-5.cpp
// bo3-5.cpp 链栈(存储结构由c2-2.h定义)的基本操作(9个)
// 大部分基本操作是由bo2-2.cpp和bo2-9.cpp中的函数改名得来
typedef SElemType ElemType; // 栈结点类型和链表结点类型一致
#include"c2-2.h"
typedef LinkList LinkStack; // LinkStack是指向栈结点的指
www.eeworm.com/read/450886/7475293
c 4-3.c
#include "stdio.h"
typedef char DataType ;
typedef struct stacknode{
DataType data;
struct stacknode *next;
}StackNode;
typedef struct{
StackNode *top; //栈顶指针
}LinkStack;
//置栈空
void Init
www.eeworm.com/read/399142/7886493
cpp maze.cpp
/************************************************************
作者: 胡娟 200608204105.
工具: VC++ 6.0.
题目: 迷宫求解.
"1"代表墙,"0"代表可以行走
从入口到出口找到一条路径.
/********
www.eeworm.com/read/398635/7933050
txt 魔王语言.txt
#include
using namespace std;
#include
typedef struct Stack
{ char c;
struct Stack *next;
}Stack,*LinkStack;
typedef struct
{ LinkStack base;
LinkStack top;
}LStack;
www.eeworm.com/read/397820/8019999
txt 新建 文本文档.txt
import java.io.*;
//定义栈类
class LinkStack{
private int maxSize;
private int[] stackArray;
public int top;
LinkStack(int s){
maxSize = s;
stackArray = new int[maxSize];
top = -1;
www.eeworm.com/read/397820/8020004
cpp 新建 文本文档.cpp
//import java.io.*;
//定义栈类
class LinkStack{
private int maxSize;
private int[] stackArray;
public int top;
LinkStack(int s){
maxSize = s;
stackArray = new int[maxSize];
top = -1;
www.eeworm.com/read/397820/8020053
cpp 车厢调度.cpp
class LinkStack{
private int maxSize;
private int[] stackArray;
public int top;
LinkStack(int s){
maxSize = s;
stackArray = new int[maxSize];
top = -1;
}
//入栈
public void push(in
www.eeworm.com/read/397820/8020061
txt 车厢调度.txt
class LinkStack{
private int maxSize;
private int[] stackArray;
public int top;
LinkStack(int s){
maxSize = s;
stackArray = new int[maxSize];
top = -1;
}
//入栈
public void push(in
www.eeworm.com/read/397820/8020067
txt 新建 文本文档.txt
class LinkStack{
private int maxSize;
private int[] stackArray;
public int top;
LinkStack(int s){
maxSize = s;
stackArray = new int[maxSize];
top = -1;
}
//入栈
public void push(in