
2、list可以當成數(shù)組來用,元素下標從0開始

(1)當0 <= n <= len(L)-1 時, 跟java、C中的數(shù)組元素索引一樣
(2)當-len(L) <= n <= -1 時, L[n] = L[len(L)+n]
(3)n不再上述范圍內是,程序引發(fā)IndexError


(1)當 0 <= a < b < len(L)時,L[a:b]返回一個由L[a], L[a+1]...L[b-1]組成的list
(2)當 0 <= b <= a < len(L)時,L[a:b]返回空的list
(3)當a,b取值不在上述范圍時,應用以下4條規(guī)則替換a,b的值,得到a,b新的值后再應用上面兩條規(guī)則。
- 若 a >= len(L), 則 a = len(L)-1
- 若 -len(L) <= a < 0, 則 a = len(L) + a
- 若 a <? -len(L), 則? a =? 0
- b的情況跟a一樣
- 當 a沒有指定時,a = 0, 當b沒指定時,b=len(L)-1

6、
Method | Description |
---|---|
Nonmutating methods | ? |
L.count(x) | Returns the number of items of L that are equal to x. |
L.index(x) | Returns the index of the first occurrence of an item in L that is equal to x, or raises an exception if L has no such item. |
Mutating methods | ? |
L.append(x) | Appends item x to the end of L ; e.g., L[len(L):]=[x]. |
L.extend(s) | Appends all the items of iterable s to the end of L; e.g., L[len(L):]=s. |
L.insert(i, x) | Inserts item x in L before the item at index i, moving following items of L (if any) "rightward" to make space (increases len(L) by one, does not replace any item, does not raise exceptions: acts just like L[i:i]=[x]). |
L.remove(x) | Removes from L the first occurrence of an item in L that is equal to x, or raises an exception if L has no such item. |
L.pop([i]) | Returns the value of the item at index i and removes it from L; if i is omitted, removes and returns the last item; raises an exception if L is empty or i is an invalid index in L. |
L.reverse( ) | Reverses, in place, the items of L. |
L.sort([f]) (2.3) | Sorts, in place, the items of L, comparing items pairwise via function f; if f is omitted, comparison is via the built-in function cmp. For more details, see "Sorting a list" on page 57. |
L.sort(cmp=cmp, key=None, reverse=False)(2.4) | Sorts, in-place, the items of L, comparing items pairwise via the function passed as cmp (by default, the built-in function cmp). When argument key is not None, what gets compared for each item x is key(x), not x itself. For more details, see "Sorting a list" on page 57. |


