代码搜索：LinkStack
找到约 226 项符合「LinkStack」的源代码
代码结果 226
www.eeworm.com/read/195829/5107205
h mltliststack.h
#define M 10 /*M个链栈*/
#define TRUE 1
#define FALSE 0
typedef struct node
{
StackElementType data;
struct node *next;
}LinkStackNode, *LinkStack;
LinkStack top[M];
/*第i号栈的进栈操作*/
i
www.eeworm.com/read/303129/3815395
h mltliststack.h
#define M 10 /*M个链栈*/
#define TRUE 1
#define FALSE 0
typedef struct node
{
StackElementType data;
struct node *next;
}LinkStackNode, *LinkStack;
LinkStack top[M];
/*第i号栈的进栈操作*/
i
www.eeworm.com/read/274763/10853891
cpp main.cpp
#include
#include "sqStack.h"
#include "LinkStack.h"
sqstack s;
linkstack top;
void main()
{
int a=1,b=1;
int x,y;
cout
www.eeworm.com/read/167649/9957191
cpp poly.cpp
#include "linkStack.h"
#include "Polynomial.h"
void main( )
/* Post: The program has executed simple polynomial
a
www.eeworm.com/read/367608/9740205
cpp sy2_1_2.cpp
/**********************************************************************************/
#include "LStack.h"
void main()
{
Linkstack S;
Llist p,s,q;
Element e,element;
Status i;
int j,k,num;
www.eeworm.com/read/201947/15392126
java set.java
package searchWay;
//import control.LinkStack;
//import control.BidirectLinkNode;
public class Set {
private static LinkQueue s=new LinkQueue();
/**
* @param args
*/
public static boo
www.eeworm.com/read/195829/5107204
c 3.8.c
int Push(LinkStack top,StackElementType x)
{
/* 将数据元素x压入栈top中 */
LinkStackNode *temp;
temp=(LinkStackNode *)malloc(sizeof(LinkStackNode));
if(temp==NULL)
return(FALSE); /* 申请空间失败 */
www.eeworm.com/read/303129/3815394
c 3.8.c
int Push(LinkStack top,StackElementType x)
{
/* 将数据元素x压入栈top中 */
LinkStackNode *temp;
temp=(LinkStackNode *)malloc(sizeof(LinkStackNode));
if(temp==NULL)
return(FALSE); /* 申请空间失败 */
www.eeworm.com/read/195829/5107231
c 3.10.c
int pushi(LinkStack top[M],int i,StackElementType x)
{
/*将元素x进入第i号链栈*/
LinkStackNode *temp;
temp=(LinkStackNode *)malloc(sizeof(LinkStackNode));
if(temp==NULL) return(FALSE); /* 申请空间失败 */
www.eeworm.com/read/303129/3815421
c 3.10.c
int pushi(LinkStack top[M],int i,StackElementType x)
{
/*将元素x进入第i号链栈*/
LinkStackNode *temp;
temp=(LinkStackNode *)malloc(sizeof(LinkStackNode));
if(temp==NULL) return(FALSE); /* 申请空间失败 */