搜索资源列表
recursion
- 递归,是函数实现的一个很重要的环节,很多程序中都或多或少的使用了递归函数。递归的意思就是函数自己调用自己本身,或者在自己函数调用的下级函数中调用自己。 递归之所以能实现,是因为函数的每个执行过程都在栈中有自己的形参和局部变量的拷贝,这些拷贝和函数的其他执行过程毫不相干。这种机制是当代大多数程序设计语言实现子程序结构的基础,是使得递归成为可能。-Recursion, is a function to achieve a very important part of many programs
ApplicationStack
- 1.进一步掌握栈的基本操作的实现。 2.掌握栈在算术表达式的计算方面的应用。 -1. Further understand the basic operation of the stack implementation. 2. Control stack in the calculation of arithmetic expression applications.
MA2
- 构造一个空的双向栈,判断双向栈是否存在,出栈,入栈,判栈空,将栈置空,判栈满,取栈顶-Construct an empty two-way stack to determine whether there is a two-way stack, out of stack, stack, sub-stack empty, set the stack is empty, sub-stack is full, take the stack
Practice2
- 车厢调度:程序对栈的任何存取(即更改,读取和状态判别等操作必须借助于基本操作。-Train scheduling: proceedings of the stack of any access (that is, changing, reading and state identification must be by means of basic operations such as Operation.