Location:
Search - stack push
Search list
Description: 包括栈的push\\pop,计数，查找等操作，简单易行，适合数据结构的初学者-including Stack push \\ pop, calculators, searching operation is simple, the data structure suitable for beginners
Platform: |
Size: 68581 |
Author: 杜莉 |
Hits:
Description: 种子填充算法用来在封闭曲线形成的环中填充某中颜色，在这里我们只填充黑色。种子填充其实上是图形学中的算法，其原理是：准备一个堆栈，先将要填充的点push进堆栈中；以后，每pop出一个点，将该点涂成黑色，然后按左上右下的顺序查看它的四个相邻点，若为白(表示还没有填充)，则将该邻点push进栈。一直循环，直到堆栈为空。此时，区域内所有的点都被涂成了黑色。这里，我们自己定义了一些堆栈的数据结构和操作，实现了堆栈的初始化、push、pop、判断是否为空、及析构。 -seed filling algorithm used in a closed curve formed by a ring filled with color, here we only filled black. Seed is actually filled with graphics algorithm, and its tenet is : preparing a stack, Filling the first point to push into Stack; After each pop up a point, this point painted black. Press the left, then the right lower in the order View its four adjacent spots, and white (said that it had not yet filled), by being neighbors push into Stack. Has been circulating until the stack is empty. At this point, all the regional point has been Tu became black. Here, our own definition of a stack data structure and operations, the realization of the initial stack, push, pop, to determine whether the air, and destructors.
Platform: |
Size: 206095 |
Author: 蒋建军 |
Hits:
Description: 用c＋＋实现了一个比较特殊的堆栈类，可以push，可以pop，输出测试栈顶指针的变化。
Platform: |
Size: 7564 |
Author: Feng Yanzhao |
Hits:
Description: 堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程
Platform: |
Size: 21678 |
Author: 韩笑 |
Hits:
Description: 包括栈的push\pop,计数，查找等操作，简单易行，适合数据结构的初学者-including Stack push \ pop, calculators, searching operation is simple, the data structure suitable for beginners
Platform: |
Size: 68608 |
Author: 杜莉 |
Hits:
Description: 种子填充算法用来在封闭曲线形成的环中填充某中颜色，在这里我们只填充黑色。种子填充其实上是图形学中的算法，其原理是：准备一个堆栈，先将要填充的点push进堆栈中；以后，每pop出一个点，将该点涂成黑色，然后按左上右下的顺序查看它的四个相邻点，若为白(表示还没有填充)，则将该邻点push进栈。一直循环，直到堆栈为空。此时，区域内所有的点都被涂成了黑色。这里，我们自己定义了一些堆栈的数据结构和操作，实现了堆栈的初始化、push、pop、判断是否为空、及析构。 -seed filling algorithm used in a closed curve formed by a ring filled with color, here we only filled black. Seed is actually filled with graphics algorithm, and its tenet is : preparing a stack, Filling the first point to push into Stack; After each pop up a point, this point painted black. Press the left, then the right lower in the order View its four adjacent spots, and white (said that it had not yet filled), by being neighbors push into Stack. Has been circulating until the stack is empty. At this point, all the regional point has been Tu became black. Here, our own definition of a stack data structure and operations, the realization of the initial stack, push, pop, to determine whether the air, and destructors.
Platform: |
Size: 205824 |
Author: 蒋建军 |
Hits:
Description: 实验题目 就地逆置
一、 实验目的
用堆栈来实现链表的就地逆置（反转）
二、 实验内容
用链栈的方法在不重新申请空间的情况下实现链表的逆置。
三、 需求分析
先输入一组数据，把它存到栈里。然后通过pop( ),push()语句来实现使栈里的数据逆置。例如：输入1，2，3，4，5，6，7。则栈里存放7，6，5，4，3，2，1，再通过栈的操作使栈里存放1，2，3，4，5，6，7。
-experimental subject in situ reverse a home, the experiment used stack to achieve the local chain of home inverse (reverse) 2. Experiment with the chain stack method is not re-apply in the case of space to achieve the inverse home chain. 3, needs analysis, importing a set of data it onto Stack Lane. Then pop (), push () statement to the achievement of the data stack Lane inverse home. For example : an input, 2,3,4,5,6,7. Stack was placed Lane 7, 6,5,4,3,2,1, and through the stack so that the operation of stack storage of 1,2,3,4, 5, 6, 7.
Platform: |
Size: 7168 |
Author: 李爱春 |
Hits:
Description: 用c＋＋实现了一个比较特殊的堆栈类，可以push，可以pop，输出测试栈顶指针的变化。
Platform: |
Size: 236544 |
Author: Feng Yanzhao |
Hits:
Description: 堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程-Realize stack code, realize all the features of the stack, PUSH, POP, insertion, destruction, empty and so on, have a debugger, you can clearly see the operation of the process stack
Platform: |
Size: 21504 |
Author: 韩笑 |
Hits:
Description: castle
给出一个城堡的地图，求其中的连通房间数，最大房间的面积，拆除某个墙壁连通两间屋子后可形成的最大房屋面积。前面求面积还比较简单，用种子填充法即可，后面的找连通两房间的实在是有很多可能。后来想到用遍历，压栈弹栈的过程要考虑清楚，不要重复压栈。也不要在边界上犯错。-castle to give a castle map, and number of rooms in which the connectivity, the largest room size, removal of walls connected to a house after 2 the formation of the largest housing area. Area in front of demand is still relatively simple method can be filled with seeds, to find the back of two connected rooms is a lot of potential. Was thought by ergodicity, the process stack push shells must consider very carefully, do not repeat the push. Do not make mistakes at the border.
Platform: |
Size: 1024 |
Author: 求索 |
Hits:
Description: This a Stack Class with Funtions Push,Pop,
check Stack is Full or Empty
Application:
Change a number from Decimal to Binary-This is a Stack Class with Funtions Push,Pop,
check Stack is Full or Empty
Application:
Change a number from Decimal to Binary
Platform: |
Size: 194560 |
Author: Le Quoc Dung |
Hits:
Description: 简单模拟栈的操作：包括栈的初始化，压栈，栈顶元素弹出以及取栈顶元素；采用C实现-Analog stack easy steps: including the stack initialization, push, pop elements as well as the Top-Top-check elements implementation using C
Platform: |
Size: 1024 |
Author: yangxh |
Hits:
Description: 设计实现4bit FIFO, 数据深度为8， 产生满， 空状态标志-The diagram of FIFO is shown in figure 1. The FIFO consists of two component: FIFO control
logic and RAM. The control logic generates the address (ADD) and write enable (WE) to the
RAM so that the first data word written into the RAM is also the first data word retrieved
from the RAM. As shown in the Figure 1, the RAM is implemented to operate as a FIFO. The
RAM is assumed to have separate data inputs and outputs, an N-bit address bus (ADD) and an
active high write enable (WE). The inputs to FIFO/Stack include PUSH, POP, INIT (all
active high) in addition to the rising edge triggered CLK input. The FIFO logic will not only
supply the address and write enable to the RAM, but will also supply active high flags for
FULL, EMPTY, NOPOP, and NOPUSH conditions.
Platform: |
Size: 3072 |
Author: shao |
Hits:
Description: 用栈实现算式的运算，通过把操作符压栈和操作符的优先级进行运算。-Formula used to achieve the computing stack, push through the operator and operator to operator priority.
Platform: |
Size: 1014784 |
Author: xdb |
Hits:
Description: 栈是允许在同一端进行插入和删除操作的特殊线性表。允许进行插入和删除操作的一端称为栈顶(top)，另一端为栈底(bottom)；栈底固定，而栈顶浮动；栈中元素个数为零时称为空栈。插入一般称为进栈（PUSH），删除则称为退栈（POP）。 栈也称为后进先出表（LIFO表）。-Create stack
Push stack
Pop stack
Stack top
Empty stack
Full stack
Stack count
Destroy stack
Platform: |
Size: 1024 |
Author: Lookchard |
Hits:
Description: C++实现的各种堆栈操作（完整版 包括：build push pop等）-stack operation
Platform: |
Size: 1024 |
Author: blizzard |
Hits:
Description: program on stack push pop
Platform: |
Size: 1024 |
Author: shishir |
Hits:
Description: 使用C语言实现数据堆栈功能，数据类型可自定义，pop，push操作性能较好-Data stack using the C language functions, data types can be customized, pop, push the operational performance is better
Platform: |
Size: 159744 |
Author: 御风 |
Hits:
Description: 提供一个数据结构中常用的堆栈函数，非常有用，对于初学数据结构的人非常有帮助。-Provide a common data structure stack function, very useful data structure for the beginner who is very helpful.
Platform: |
Size: 179200 |
Author: chenggeng |
Hits:
Description: 栈的基本操作，压栈，出栈，初始化以及判定栈是否为空-The basic operation of the stack, push, stack, initialization, and to determine whether the stack is empty
Platform: |
Size: 2048 |
Author: 郑琦 |
Hits: