python 链表和列表_Python列表是单链链表还是双链表？

pythonlist.append()的时间复杂度是O（1）。{请参阅^上的Python。在

在内部，python列表是指针的向量：typedef struct {

PyObject_VAR_HEAD

/* Vector of pointers to list elements. list[0] is ob_item[0], etc. */

PyObject **ob_item;

/* ob_item contains space for 'allocated' elements. The number

* currently in use is ob_size.

* Invariants:

* 0 <= ob_size <= allocated

* len(list) == ob_size

* ob_item == NULL implies ob_size == allocated == 0

* list.sort() temporarily sets allocated to -1 to detect mutations.

*

* Items must normally not be NULL, except during construction when

* the list is not yet visible outside the function that builds it.

*/

Py_ssize_t allocated;

} PyListObject;

根据需要调整ob_item向量的大小，并进行过度分配，以得出附加项的摊余O（1）成本：

^{pr2}$