因为你建立了一个链表，就像我们现在看到的，然后你可能想把它转化为一个行列式，从而进行一些操作。
Because you build up a list in simulations of the sort we looked at, and then you might want to change it to an array to perform some operations on it.
我不会用太多时间来分析这些操作，因为我的方法是从另一个角度来使用链表(稍后进行解释)。
I won't spend much time analyzing these operations, because my approach to linked lists will be from a different perspective (which I'll explain later).
换句话说，新项目被添加到尾部，映射表查找操作将项目移到链表的尾部。
In other words, new items are added to the end, and map lookups move items to the end of the linked list.
为方便事件表和队列的操作，采用的数据结构是链表。
For the convenience of operating of the event table and queues, link as data structure is adopted.
本文对方案的完备性和性能进行了讨论，同时给出了典型的链表操作算法和废料收集算法。
We discuss the completeness and efficiency of this scheme, and also give list processing and garbage collection algorithm.
利用索引表方法解决了广义操作链表对造型操作过程跟踪信息量过大的问题。
An indexing list, which we developed, is utilized to compress the large amount of information produced in the course of tracking.
如果你访问元素的索引，一个链表是不是一个好办法：你必须遍历列表的开始，所以这是一个O (n)的操作。
If you access elements by index, a linked list is not a good solution: you have to traverse the list from the beginning, so it is an o (n) operation.
在实现多项式的运算过程中，通过链表来找到多项式的每一项，并对两个链表的节点执行相应操作来实现运算。
Polynomial operations in the realization of the process, through the list to find the polynomial of each, and two lists of nodes perform the appropriate action to implement operations.
在实现多项式的运算过程中，通过链表来找到多项式的每一项，并对两个链表的节点执行相应操作来实现运算。
Polynomial operations in the realization of the process, through the list to find the polynomial of each, and two lists of nodes perform the appropriate action to implement operations.
应用推荐