• Then each person can be friends with anywhere from 0 to n-1 other people.

    那么每一个人可以有0 ~n - 1个朋友。

    youdao

  • This problem is the dreaded N + 1 problem.

    这就是可怕的N +1问题。

    youdao

  • It's more work to deal with more complicated N+1 query situations.

    处理复杂的N+1查询情况需要更多的工作。

    youdao

  • Next, the NumbersInt process would produce (n + 1).

    接下来,NumbersInt进程会产生(n + 1)。

    youdao

  • So when we count, generally, again, we start from zero, we go to N minus 1.

    当我们计数时,一般的,再次强调,我们从0开始,到N-1结束。

    youdao

  • Groups are numbered from 1 to n, whereas group (0) is the complete regular expression.

    从1到n对组进行编号,而group(0)是一个完整的正则表达式。

    youdao

  • If there are an odd number of people, n can be written as 2k+1.

    如果有奇数位选民,人数n可以写作为2k+1。

    youdao

  • N+1, Here is Rogia's station: poem, photographs, travels…

    N+1,这里是骆家驿站:诗歌、摄影、旅行…

    youdao

  • STRESS TEST, n. 1.

    压力测试(STRESS TEST),名词。

    youdao

  • Eager evaluation can also help with the n+1 Selects Problem.

    即时抓取还有助于解决 n+1选择问题。

    youdao

  • Eager evaluation can also help with the n+1 Selects Problem.

    即时抓取还有助于解决 n+1选择问题。

    youdao

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

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

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