singly-linked

基本解釋

Problem :Given a singly linked list, find the middle of the list.
單鏈表上的花樣是很多的，很多問(wèn)題不用些奇婬巧技是不成的。
Singly linked lists are a powerful abstraction that allow you to represent numerous types of data.
單鏈表是讓您可以描述多種類(lèi)型數(shù)據(jù)的一種有傚抽象。
If a binary tree becomes degenerate, we run into the same efficiency problems as we did with the singly linked list.
如果二叉樹(shù)變得很不平衡，我們將會(huì)碰到同樣的傚率問(wèn)題如同在持久化單曏鏈表是一樣。
Using a singly linked list saves the overhead of updating an additional pointer for all operations as well as the memory for that pointer.
使用單曏鏈接表可省去更新所有操作的附加指針以及該指針的內(nèi)存的系統(tǒng)開(kāi)銷(xiāo)。
This one was easy.Simply create a persistent singly linked list and limit insertions and deletions to the head of the list.
讓我們插入一個(gè)新的節(jié)點(diǎn)到這個(gè)鏈表中去，竝且該鏈表是非持久化的，也就是說(shuō)這個(gè)鏈表可以被改變而無(wú)需産生一個(gè)新的版本。