• 相似的问题还包括过多的递归。

    A similar problem is too much recursion.

    youdao

  • 请注意传统的递归首字母缩写。

    Note the traditional recursive acronym..

    youdao

  • 请注意broker是尾递归的。

    Notice that broker is tail recursive.

    youdao

  • 我使用目录技术来处理这种递归引用。

    I use a directory approach to handle these recursive references.

    youdao

  • 这就是一个绝妙的递归定义。

    It's actually a wonderful recursive definition.

    youdao

  • 另一个重要的概念是递归。

    There is also the concept of recursion which is important.

    youdao

  • 可见,递归函数与循环有很多类似之处。

    As you can see, recursive functions and loops have quite a bit in common.

    youdao

  • 递归方法也需要显式的返回类型。

    Recursive methods also require an explicit return type.

    youdao

  • 接下来,创建递归函数。

    "Next, you'll create a recursive function."

    youdao

  • 递归的另一个实例如下。

    Another example of recursion at work is the following.

    youdao

  • 如果你还不明白什么是递归,就读这个句子。

    If you still don't know what recursion is, read this sentence.

    youdao

  • 使用归纳数据编写递归过程非常简单。

    With inductive data, it is fairly easy to write recursive procedures.

    youdao

  • 更严重的问题是类定义中可能存在多态递归。

    The more serious problem is the potential for polymorphic recursion in class definitions.

    youdao

  • 将一个常见的循环转化为递归函数。

    Converting a common loop to a recursive function.

    youdao

  • 这是递归的停止条件。

    This is the stop condition for the recursion.

    youdao

  • 递归通用表表达式 (RCTE)

    Recursive Common Table Expression – RCTE

    youdao

  • 例如,考虑在一个递归方法中会发生的事情。

    Consider what would happen with a recursive method, for instance.

    youdao

  • 要了解其中的递归逻辑,请参阅存档的源文件。

    To understand this recursive logic, check out the documented source file.

    youdao

  • 对更复杂的递归过程来说这是一个通用的模式。

    This is a common pattern for more complex recursive procedures.

    youdao

  • 这就是我们使用递归的原因。

    This is the reason why we use recursion.

    youdao

  • 可以证明,这种递归解法需要耗费指数级的时间。

    It can be shown that this recursive solution takes exponential time to run.

    youdao

  • 如果使用子程序的话,它不能是递归的。

    If you use a subroutine, it cannot be recursive.

    youdao

  • 以计算机术语表述,这条规则也可以称作递归树下行。

    In computer terms, this rule is also known as recursive tree descent.

    youdao

  • 所以我们递归处理列表其余部分,并再次尝试。

    So we recurse with the rest of the list and try it again.

    youdao

  • 我们的下一个基于列表的递归函数示例要稍微复杂一些。

    Our next example of a recursive function on lists will be a little more complicated.

    youdao

  • 在某些情况下,您可以递归地使用首选数据源模式。

    In some situations, you can use the Preferred Data Source Pattern recursively.

    youdao

  • 问题在于,我们能否在不使用递归的前提下实现访问者模式?

    The question is, can we implement the Visitor pattern without recursion?

    youdao

  • 使用first和rest 组合实现递归效果很好。

    The combination of first and rest works well with recursion.

    youdao

  • 第一个if 语句在列表为空的情况下中断递归,返回零值。

    The first if statement breaks the recursion if the list is empty, returning zero.

    youdao

  • 但是t被递归地传递给count,和前面的示例一样。

    But t is recursively passed to count again, just as with the earlier example.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定