Location:
Search - sqstack
Search list
Description:
int *base
int *top
int stacksize
}sqstack
inistack(sqstack &s)
{
s.base=(int*)malloc(stackintsize*sizeof(int))
if(!s.base) exit(-2)
s.top=s.base
s.stacksize=stackintsize
return 1
}- int *base int *top int stacksize }sqstack inistack(sqstack s) { s.base=(int*)malloc(stackintsize*sizeof(int)) if(!s.base) exit(-2) s.top=s.base s.stacksize=stackintsize return 1 }
Platform: |
Size: 3046 |
Author: 王键 |
Hits:
Description:
问题描述
假设停在铁路调度站入口处的车厢序列的编号依次为1，2，3..n。设计一个程序，求出所有可能由此输出的的长度为n的车厢序列。
基本要求
在栈的顺序存储结构SqStack之上实现栈的五种基本要求，即实现栈类型。除了栈初始化操作之外，都要按函数实现。Push（s,x）是一个布尔函数，当且仅当栈s上溢出时返回“假“值；再说明一个ElemType型的常量StackEmptyMark，操作pop（s）和top（s）遇到栈s为空的情况时返回值StackEmptyMark。程序对栈的任何存取必须借助于基本操作要求。
Platform: |
Size: 3069 |
Author: 刘伟昌 |
Hits:
Description: 和线性表类似，栈也有两种存储表示：顺序栈和链栈。
顺序存储结构简称为顺序栈。和顺序表类似，对顺序栈也需要事先为它分配一个可以容纳最多元素的存储空间。
-and linear scale similar Stack also have two storage : order Stack and Stack chain. Sequence storage structure referred to as the sequence of stack. Table and order similar to the order Stack also needs prior to allocate it can accommodate a maximum of elements of storage space.
Platform: |
Size: 8076 |
Author: 小虫子 |
Hits:
Description: 数据结构，栈的应用，表达式求值的源码及实验报告！
Platform: |
Size: 45377 |
Author: Jason Jue |
Hits:
Description: 先序遍历非递归算法 #define maxsize 100 typedef struct { Bitree Elem[maxsize] int top }SqStack void PreOrderUnrec(Bitree t) { SqStack s StackInit(s) p=t while (p!=null !StackEmpty(s-preorder non - recursive algorithm # define maxsize 100 typedef struct (Bitree Elem [maxsize]) int top SqStack void PreOrderUnrec (Bitree t) (SqStack s StackInit (s) p = t while (p! = Null! StackEmpty (s
Platform: |
Size: 3376 |
Author: 万方 |
Hits:
Description: 设计一个车厢调度的程序，输出所有可能的序列 假设停在铁路调度站入口处的车厢序列的编号依次为1，2，3，n , 设计一个程序，求出所有可能的长度为n 的车厢序列。 实现栈的顺序存储结构SqStack之上实现栈的基本操作，即实现栈类型。程序对栈的基本操作必须借助于基本操作进行。 测试数据取 n=1,2,3, 程序输出的结果应该在屏幕上显示出来-Designs the procedure which a compartment dispatches, the output all
possible sequences supposition to stop in the railroad dispatch
station entrance compartment sequence serial number is in turn 1, 2,
3, n, Designs a procedure, extracts all possible lengths is the n
compartment sequence. Realizes above stack smooth memory structure
SqStack to realize the stack elementary operation eo, namely
realization stack type. The procedure must draw support to the stack
elementary operation eo in the elementary operation eo carries on. The
test data takes n=1,2,3, The procedure output result should show on the screen
Platform: |
Size: 1018 |
Author: 黎明 |
Hits:
Description: 先序遍历非递归算法 #define maxsize 100 typedef struct { Bitree Elem[maxsize] int top }SqStack void PreOrderUnrec(Bitree t) { SqStack s StackInit(s) p=t while (p!=null !StackEmpty(s-preorder non- recursive algorithm# define maxsize 100 typedef struct (Bitree Elem [maxsize]) int top SqStack void PreOrderUnrec (Bitree t) (SqStack s StackInit (s) p = t while (p! = Null! StackEmpty (s
Platform: |
Size: 3072 |
Author: 万方 |
Hits:
Description:
int *base
int *top
int stacksize
}sqstack
inistack(sqstack &s)
{
s.base=(int*)malloc(stackintsize*sizeof(int))
if(!s.base) exit(-2)
s.top=s.base
s.stacksize=stackintsize
return 1
}- int*base int*top int stacksize }sqstack inistack(sqstack s) { s.base=(int*)malloc(stackintsize*sizeof(int)) if(!s.base) exit(-2) s.top=s.base s.stacksize=stackintsize return 1 }
Platform: |
Size: 3072 |
Author: 王键 |
Hits:
Description:
问题描述
假设停在铁路调度站入口处的车厢序列的编号依次为1，2，3..n。设计一个程序，求出所有可能由此输出的的长度为n的车厢序列。
基本要求
在栈的顺序存储结构SqStack之上实现栈的五种基本要求，即实现栈类型。除了栈初始化操作之外，都要按函数实现。Push（s,x）是一个布尔函数，当且仅当栈s上溢出时返回“假“值；再说明一个ElemType型的常量StackEmptyMark，操作pop（s）和top（s）遇到栈s为空的情况时返回值StackEmptyMark。程序对栈的任何存取必须借助于基本操作要求。-Description of the problem assume that stopped at the railway station at the entrance to the train scheduling sequence number followed by 1,2,3 .. n. Design a procedure to derive all the possible length of the resulting output of the compartment for the n sequences. The basic requirements of the order of storage in the stack structure to achieve stack SqStack above the five basic requirements, namely, the realization of the type stack. In addition to the initialization of the stack, the function must be in accordance. Push (s, x) is a Boolean function, if and only if s on stack overflow return false value ElemType describe a type of constant StackEmptyMark, operation pop (s) and top (s) encountered as the stack s empty when the return value StackEmptyMark. Procedures on the stack must be through the use of any access to the basic operating requirements.
Platform: |
Size: 3072 |
Author: 刘伟昌 |
Hits:
Description: 和线性表类似，栈也有两种存储表示：顺序栈和链栈。
顺序存储结构简称为顺序栈。和顺序表类似，对顺序栈也需要事先为它分配一个可以容纳最多元素的存储空间。
-and linear scale similar Stack also have two storage : order Stack and Stack chain. Sequence storage structure referred to as the sequence of stack. Table and order similar to the order Stack also needs prior to allocate it can accommodate a maximum of elements of storage space.
Platform: |
Size: 8192 |
Author: 小虫子 |
Hits:
Description: 数据结构，栈的应用，表达式求值的源码及实验报告！-Data structure, stacks of applications, the source expression is evaluated and experimental report!
Platform: |
Size: 45056 |
Author: Jason Jue |
Hits:
Description: 一个简单的学生信息管理系统c语言程序,基本上应该有的功能都可以基本实现了-Students a simple information management system c language program basically should have the basic functions can be achieved
Platform: |
Size: 382976 |
Author: 嘉嘉 |
Hits:
Description: 这是我写一个stack的实现,其中有不同的算法用到了stack,希望能对学习数据的人有用,请注意 在vc下使用
Platform: |
Size: 2084864 |
Author: soyygywvt |
Hits:
Description: #define MAX 100
typedef int ElemType
typedef struct{
ElemType*data
int top
} SqStack
顺序栈的基本操作，1，初始化建立空栈 2，入栈，3，显示所有的数据 4，退出 。有菜单栏，里面有word文档的运行结果显示-# define MAX 100 typedef int ElemType typedef struct (ElemType* data int top ) SqStack the order of the basic operation of the stack, 1, initialize the establishment of an empty stack 2 stack, 3, shows all the data 4, exit. Are on the menu bar, which has run the results showed that word of the document
Platform: |
Size: 103424 |
Author: xiaoting |
Hits:
Description: 数据结构中顺序栈的实现,包含插入，删除，更新操作。-realize the qlstack
Platform: |
Size: 962560 |
Author: 猫猫 |
Hits:
Description: 栈的基本操作，综合实现，对于初学者简单易懂。-Basic operation of the stack, comprehensive implementation, easy to understand for beginners.
Platform: |
Size: 1024 |
Author: xufei |
Hits:
Description: 中序遍历递归与非递归，很简单的代码，就是这么简单！-#include "stdio.h"
#include"stdlib.h"
#define MAXSIZE 20
typedef int datatype
typedef struct Node
{
datatype data
struct Node*lchild
struct Node*rchild
}Btnode,*Btree
typedef struct
{
Btnode*s[MAXSIZE]
int top
}sqstack
Platform: |
Size: 1024 |
Author: 赵王 |
Hits:
Description: 用C语言实现了顺序栈，包括创建栈、押栈、出栈等。-Using C language to implement the order of the stack, including the creation of the stack, charge stack, the stack and so on.
Platform: |
Size: 94208 |
Author: 冬晨 |
Hits:
Description: 实现顺序栈的建立，删除，插入一个元素等基本操作-realize sqstack s basic function,such as insert a data,delete a data and so on.
Platform: |
Size: 1024 |
Author: 李玲丽 |
Hits:
Description: SQStack,顺序栈（与链栈有区别），存c写的，注释很清楚-SQStack, the order of the stack (stack with the chain are different), storage c written comments clearly
Platform: |
Size: 63488 |
Author: huangjun |
Hits: