链表 英语是什么意思 - 英语翻译

• list
• linked list
• lists
• linked lists

在 中文 中使用 链表 的示例及其翻译为 英语

一个是链表长度。
One is the chain length.

如果链表有一个循环.
If the tree has a cycle.

链表的C语言实现：.
Implementation in the C language:.

如果链表有一个循环.
If graph contains a cycle.

现在我们介绍链表数据结构。
We now introduce the Linked List data structure.

G是链表中所有结点的值的一个子集.
G is a subset of all values in the linked list.

辅助的首要数据结构之一是链表。
One of the StarPU primary data structures is the codelet.

但这个交易链表还不是区块链。
But this linked list of transactions is not yet a blockchain.

链表由几个分开分配的节点组成。
A linked list consists of several separately allocated nodes.

最后是循环链表，它形成一个循环。
And finally, the circular linked list, which forms a circle.

Python乘法运算可应用于链表。
The Python multiplication operation can be applied to lists.

创建一个词链表并将其存储在变量sent1。
Create a list of words and store it in a variable sent1.

链表的其他位置，i＝〔1…n-1〕。
The other positions of the linked list, i=[1… N-1].

然而，一般来说，链表可以使用任何排队策略。
In general, however, the list can use any queueing strategy.

还有其它三个对象也在零世代链表里。
Three other objects are in the Generation Zero linked list also.

可假定整个链表结构中没有循环。
You may assume there are no cycles anywhere in the entire linked structure.

所以我们还需要一个插入元素到链表的方法。
So, we need some way to go ahead and insert elements into list.

然而，链表是可变的，其内容可以随时修改。
However, lists are mutable, and their contents can be modified at any time.

再从键盘输入某一学生姓名，将其从链表中删除。
Simply clicking on a student's name removes them from the list.

链表链表应该是面试时被提及最频繁的数据结构。
Linked lists are the most frequently met data structures during interviews.

Lisp支撑的重要数据结构之一是链表。
One of the important data structures that Lisp supports is linked list.

序列，链表和树也是函数式语言中非常常见的数据结构。
Sequences, lists and trees are very common data structures in functional languages.

Lisp支持的重要数据结构之一是链表。
One of the important data structures that Lisp supports is linked list.

如何以及为什么ReactFiber使用链表遍历组件树.
The how and why on React's usage of linked list in Fiber to walk the component's tree.

Lisp支撑的重要数据结构之一是链表。
One of the valuable data structures that Lisp maintains is linked list.

而且，浸入式链表不能直接保存内建类型（int没有link成员变量）。
Also, intrusive lists cannot hold built-in types directly(an int does not have a link member).

另一个选项是将其添加到链表的末尾。
The other option is to add it to the end of the linked list.

链表可以更容易地有机增长：必须预先定义或重新定义阵列以进行有机增长。
A linked list can more easily grow organically: an array has to be p-defined or re-defined for organic growth.

同样的，链表[SnF,SnF-gt;-FnS,FnS]是不一致的--这些句子不能全为真。
Equivalently, the list[SnF, SnF-gt;-FnS, FnS] is inconsistent- these sen- tences cannot all be true together.

使用链表加法、set和sorted操作，计算句子sent1…sent8的词汇表。
Using list addition, and the set and sorted operations, compute the vocabulary of the sentences sent1… sent8.