5. Data Structures
This chapter describes some things you’ve learned about already in more detail, and adds some new things as well.
5.1. More on Lists
The list data type has some more methods. Here are all of the methods of list objects:
-
list.
append
(
x
)
-
Addan item to the end of the list. Equivalent to a[len(a):] = [x].
-
list.
extend
(
L
)
-
Extend the list by appendingall the items in the given list. Equivalent to a[len(a):] = L. 这里是切片的意思。比如说,a有6个元素,第6个元素的索引是5,len(a)=6,将L的值赋到这个a[6]的元素,这样a就有7个元素了。
-
list.
insert
(
i,
x
)
-
Insert an item at a given position. The first argument is the index of the element before which to insert, soa.insert(0, x) inserts at the front of the list, and a.insert(len(a), x) is equivalent to a.append(x).
-
list.
remove
(
x
)
-
Remove the first item from the listwhose value is x. It is an error if there is no such item.
-
list.
pop
(
[
i
]
)
-
Remove the itemat the given positionin the list,and return it.If no index is specified, a.pop() removes and returns the last item in the list. (The square brackets around the i in the method signature denote that the parameter is optional, not that you should type square brackets at that position. You will see this notation frequently in the Python Library Reference.)
-
list.
index
(
x
)
-
Return the index in the list of the first itemwhose value is x. It is an error if there is no such item.
-
list.
count
(
x
)
-
Return the number of times x appears in the list.
-
list.
sort
(
)
-
Sort the items of the list in place.
-
list.
reverse
(
)
-
Reverse the elements of the list in place.
An example that uses most of the list methods:
You might have noticed that methods like insert, remove or sort that modify the list have no return value printed – they return None. [1] This is a design principle for all mutable data structures in Python.
5.1.1. Using Lists as Stacks
The list methods make it very easy to use a list as a stack, where the last element added is the first element retrieved (“last-in, first-out”). To add an item to the top of the stack, use append(). To retrieve an item from the top of the stack, use pop() without an explicit index. For example:
5.1.2. Using Lists as Queues
It is also possible to use a list as a queue, where the first element added is the first element retrieved (“first-in, first-out”); however, lists are not efficient for this purpose. While appends and pops from the end of list are fast, doing inserts or pops from the beginning of a list is slow (because all of the other elements have to be shifted by one).
To implement a queue, use collections.deque which was designed to have fast appends and pops from both ends. For example:
#下面的这些可以说变成了"first-into-rightest, leftest-out" 跟"first-in, first-out" 在pop的时候选择方向相反。
5.1.3. List Comprehensions
List comprehensions provide a concise way to create lists. Common applications are to make new lists where each element is the result of some operations applied to each member of another sequence or iterable, or to create a subsequence of those elements that satisfy a certain condition.
For example, assume we want to create a list of squares, like:
We can obtain the same result with:
This is also equivalent to squares = list(map(lambda x: x**2, range(10))), but it’s more concise and readable.
A list comprehension consists of brackets containing an expression followed by a for clause, then zero or more for orif clauses. The result will be a new list resulting from evaluating the expression in the context of the for and ifclauses which follow it. For example, this listcomp combines the elements of two lists if they are not equal:
and it’s equivalent to:
Note how the order of the for and if statements is the same in both these snippets.
If the expression is a tuple (e.g. the (x, y) in the previous example), it must be parenthesized.
List comprehensions can contain complex expressions and nested functions:
5.1.4. Nested List Comprehensions
The initial expression in a list comprehension can be any arbitrary expression, including another list comprehension.
Consider the following example of a 3x4 matrix implemented as a list of 3 lists of length 4:
The following list comprehension will transpose rows and columns:
这里,运算从右向左,进行完了之后,进入右边,因为右边有方括号,所以输出的将是数列。
当完成第一个row[0](来自于matrix[0])之后,for row in martix 又进行输出row[0],只不过这次是matrix[1]中的,...,一直输出到matrix[2]完成后跳出左边的循环,继续右边for i in range(4)的循环。目的是为了遍历输出martix[0], martix[1], matrix[2] 中的所有索引为i 的元素。
As we saw in the previous section, the nested listcomp is evaluated in the context of the for that follows it, so this example is equivalent to:
which, in turn, is the same as:
这是是我自己想到的。我会用这样的方法
In the real world, you should prefer built-in functions to complex flow statements. The zip() function would do a great job for this use case:
See Unpacking Argument Lists for details on the asterisk in this line.
-
zip
(
*iterables
)
-
Make an iterator that aggregates elements from each of the iterables.
Returns an iterator of tuples, where the i-th tuple contains the i-th element from each of the argument sequences or iterables. The iterator stops when the shortest input iterable is exhausted. With a single iterable argument, it returns an iterator of 1-tuples. With no arguments, it returns an empty iterator. Equivalent to:
The left-to-right evaluation order of the iterables is guaranteed. This makes possible an idiom for clustering a data series into n-length groups using zip(*[iter(s)]*n).
zip() should only be used with unequal length inputs when you don’t care about trailing, unmatched values from the longer iterables. If those values are important, use itertools.zip_longest() instead.
zip() in conjunction with the * operator can be used to unzip a list: