好了，所以如果我，是在链表的最后，这个就是我的总价值了。
Alright, so if I'm at the end of the chain, that's my value.
所以我只要不用刻意的除以，我有的是一个链表的链表。
So I just, inadvertently, divided by, I have a list of lists.
我不会用太多时间来分析这些操作，因为我的方法是从另一个角度来使用链表(稍后进行解释)。
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).
因此，如果我写了一个只代表我特别链表的模式，就不能保证有其他人会读我的模式并从中提取相同的数据模型。
Thus, if I were to write a schema to represent my particular linked list, there is no guarantee that another person will read my schema and extract from it the same data model.
读取我模式的客户机必须能理解我在描述这样一个链表结构，并且必须接受所有可能的反序列化相同图的XML版本。
The client that reads my schema must be able to understand that I am describing such a linked list structure and thus must accept all possible versions of the XML that de-serialize to the same graph.
我应该除以链表的长度。
我真正想做的是，除以链表的个数。
And what I really wanted to do is, divide by the number of lists.
我前面说过，空链表就是两个域都包含一个空指针的LinkedList。
I said earlier that an empty list is a LinkedList containing a null pointer in both fields.
我建议执行有着linkedlist类的链表，该类包含一个有empty类或cons类的域，而不是象我们前面做的那样，单个执行链接链表。
Instead of implementing singly linked lists as we did earlier, I recommend implementing such lists with a class LinkedList that contains a field holding either an Empty or a Cons class.
为什么我的双向链表删除以前的链接？
的面向对象实现链表，我不知道为什么增加到底是不是为我工作，请指教。
C + + - OOP implementation of linked list, I not sure why adding to end is not working for me, please advise.
我的问题：这可能与一个以上的一个或多个先前的节点的节点创建链表，如何将结构是什么样子的？
My Question: Is it possible to create linked list with nodes with more than one next or more than one previous nodes, if so how would the struct look like?
我写信是双向链表的代码。
我们来检查检查，我写了一个小测试脚本，我写这个脚本来测试单元排序，它能够打印出每一轮结束后，链表的是什么样子的。
Let's check it out. I've written a little bit of a test script here, so if we test cell sort, and I've written this so that it's going to print out what the list is at the end of each round, OK.
这样相比效率就高了很多。在我的程序中，我就使用了这种单链表来管理。
As another example, some of the system-supplied SCSI class drivers use lookaside lists to allocate and release memory for SRBs.
Scala的默认值：我如何获得一个默认值的类型的任何在Scala中而创建一个链表的？
Scala default Values: How do I get a default value from type Any in Scala while creating a LinkedList?
Scala的默认值：我如何获得一个默认值的类型的任何在Scala中而创建一个链表的？
Scala default Values: How do I get a default value from type Any in Scala while creating a LinkedList?
应用推荐