python list查找元素_如何在Python中使用O（1）查找列表元素？

最新推荐文章于 2022-04-15 17:16:45 发布

weixin_39721853

最新推荐文章于 2022-04-15 17:16:45 发布

阅读量138

点赞数

文章标签： python list查找元素

Python中，从列表检索元素的时间复杂度为O(1)，因为列表底层采用数组实现，通过指针直接访问内存地址。创建如['perry', 1, 23.5, 's']这样的列表时，实际上是创建了一个包含指向各个对象内存地址的指针数组。由于指针大小固定，解释器可以通过指针和偏移量快速定位到列表的任何元素。

摘要由CSDN通过智能技术生成

Today in class, we learned that retrieving an element from a list is O(1) in Python. Why is this the case? Suppose I have a list of four items, for example:

li = ["perry", 1, 23.5, "s"]

These items have different sizes in memory. And so it is not possible to take the memory location of li[0] and add three times the size of each element to get the memory location of li[3]. So how does the interpreter know where li[3] is without having to traverse the list in order to retrieve the element?

解决方案

A list in Python is implemented as an array of pointers1. So, what's really happening when you create the list:

["perry", 1, 23.5, "s"]

is that you are actually creating an array of pointers like so:

[0xa3d25342, 0x635423fa, 0xff243546, 0x2545fade]

Each pointer "points" to the respective objects in memory, so that the string "perry" will be stored at address 0xa3d25342 and the number 1 will be stored at 0x635423fa, etc.

Since all pointers are the same size, the interpreter can in fact add 3 times the size of an element to the address of li[0] to get to the pointer stored at li[3].