5次递归调用，才得到这个答案。
实现思路：使用递归调用。2、分页显示。
Implementation ideas: the use of recursive calls. 2, paging display.
添加一个可到达的退出分支以停止递归调用。
Add a reachable exit branch to stop the recursive invocation.
这一优化将递归调用转换成本地回路，这样可以防止栈溢出。
This optimization transforms recursive calls into local loops, in order to prevent stack overflows.
递归调用之后，我们将当前节点的值加到递归调用的结果上。
After the recursive call completes, we add the value of the current node to the results of the recursive call.
这可以使一个嵌套很深，被递归调用的函数很快退出。
This can be used to allow a quick exit to deeply nested, recursively called functions.
从那里开始，每一次后续的递归调用都使用那些参数作为新的值。
From there, each successive recursive call USES the parameters as new values.
每个额外的递归调用都会占用更多的内存，从而减慢浏览器的运行。
Each additional recursive call takes up memory, and eventually will slow down the browser.
可再入的函数可以被安全地递归调用或由多任务多次调用。
A reentrant function can be safely called recursively or from multiple tasks.
当我们将循环转化为递归函数时，递归调用是函数所做的最后一件事情。
When we converted our loop to a recursive function, the recursive call was the last thing that the function did.
简而言之，递归调用就是代表你的SQL执行的SQL语句。
In short, recursive calls are basically SQL performed on behalf of your SQL.
默认情况下，它将进行递归调用。因此，您也可以在任何一个内部类中发现方法声明。
This one makes recursive calls by default; therefore, it will also find method declarations in any inner classes.
它是由递归下行复合数据结构引起的，这种下行方式有时在一次递归调用中要下行多级。
It is caused by recursively descending a composite data structure in such a way that, sometimes, more than one step in the descent is taken in a single recursive call.
方法的递归调用在报表显示为调用的总合，显示程序在这方面需要更聪明一些。
Recursive methods is reported as sum of the calls. The viewer should be more clever in this respect.
因此，文件系统一定必要产生附加的页面错误，因为这将导致无限递归调用。
Thus, the file system must not generate additional page faults because this may lead to an "infinite" recursion.
用a | a格式写的剩余字母的值如果已没有字母，则该值为空；否则，递归调用该模板。
The value of the remaining letters written in the a | a format. If there are no letters left, the value is empty; otherwise, you call the template recursively.
当前计算的结果依赖于之前的部分结果，所以，在每次后续递归调用中，我们向前传递那些结果。
The result of the present computation depended on the partial results before it, so in each successive recursive call, we pass those results forward.
当然还有可能在递归调用中使用函数名称，但是你将很快看到在当下他通常不大实用。
Well, there is also a possibility of using function names for recursion, but you will soon see that this is often impractical nowadays.
在很多方面，可以认为xsl：apply - templates是对样式表自身的递归调用！
In many respects, you can think of XSL: apply-templates as a recursive call into the stylesheet itself!
例如，可以为同一函数定义多种处理方式，还可以对递归调用应用模式匹配，这样做可以简化某些函数。
For example, the ability to define multiple approaches to the same functions and employ pattern matching for recursive calls simplifies some functions.
因此，只有在非常复杂的大量使用循环和递归调用的应用程序中，才需要考虑这种潜在的影响。
Therefore, the potential impact is a factor only in complex applications where iterations and recursive invocations are heavily used.
在访问者实现中可以清楚地看到这一点，您可以看到对eval - concat函数的所有递归调用。
This is obvious in the Visitor implementation where you see all of the recursive calls to the eval-concat function.
检索实体模式的另一种方法是通过递归调用getSubCategories方法来遍历类别模式。
The other way to retrieve the category schema is to traverse the category schema objects by calling the getSubCategories method recursively.
如果逻辑上不要求运算符过程调用自身，请移除任何递归调用，或将其替换为不调用自身过程的语句。
If your logic does not require the operator procedure to call itself, then remove any recursive calls or replace them with statements that do not call their own procedure.
如果仔细观察print _ report_i，您会发现在函数中递归调用之后没有再进一步发生任何事情。
If you evaluate print_report_i, you will see that there is nothing further that happens in the function after the recursive call.
设计并实现了一个面向教学的类c编译器，支持全局或局部变量的定义、函数参数传递和函数递归调用。
Designing and implementing a teaching-oriented C-like compiler, which supports the definition of local and global variables, function parameters, as well as recursive call of functions.
因为同步变量使用他们自己内部的标识记录脏数据状态，在属性设置函数中设置脏位会引起递归调用问题。
Because SyncVars use properties internally to mark themselves as dirty, setting them dirty inside property functions could lead to recursion problems.
在围绕g _ range参数所定义的全部可能范围构建签名时，check_dynamics函数将递归调用自身。
The check_dynamics function recursively calls itself while building signatures encompassing the full range of possibilities defined by the g_range parameter.
该表达式是对lazy - seq - fibo的一个递归调用，不过这次，它调用的是有两个参数的情况，并向其传递0和1。
That expression is a recursive call to lazy-seq-fibo, but this time, it is calling the two argument case, passing in 0 and 1 to it.
该表达式是对lazy - seq - fibo的一个递归调用，不过这次，它调用的是有两个参数的情况，并向其传递0和1。
That expression is a recursive call to lazy-seq-fibo, but this time, it is calling the two argument case, passing in 0 and 1 to it.
应用推荐