您的位置:首页 > 编程语言 > Python开发

Python列表的内置方法

2016-07-13 15:40 459 查看
常用的列表内置方法:

append()
列表中追加数据,追加的数据在列表最后面

>>> name_list=[‘zhangsan', 'lisi', 'wangwu']
>>> name_list.append('liumazi')
>>> name_list
['zhangsan', 'lisi', 'wangwu', 'liumazi']

del list[#]:
删除列表中指定下标位置的元素

>>> name_list
['zhangsan', 'lisi', 'wangwu', 'liumazi', 'zeng']
>>> del name_list[2]

count()
统计列表中某元素出现的次数

>>> list1=['11','11','22']
>>> list1.count('11')
2

extend()
扩展列表,将一个列表加入到另一个列表中

>>> li1=['11','22']
>>> li2=['22','33']
>>> li1.extend(li2)
>>> li1
['11', '22', '22', '33']
>>> li1.extend(['44'])
>>> li1
['11', '22', '22', '33', '44']

index()
返回列表中第一次出现的指定元素的下标

>>> li1
['11', '22', '22', '33', '44']
>>> li1.index('22')
1

insert()
在列表中的指定下标位置中插入值

>>> li1
['11', '22', '22', '33', '44']
>>> li1.insert(3,'555')
>>> li1
['11', '22', '22', '555', '33', '44']

pop()
删除并返回列表中指定下标的值,如果没有给出下标,则删除最后一个值

['11', '22', '22', '555', '33', '44']
>>> li1.pop()
'44'
>>> li1.pop(4)
'33'

remove()
删除列表中指定的值,只删除第一次出现的值。如果给出的值不存在,则报错

>>> li1
['11', '22', '22', '555']
>>> li1.remove('22')
>>> li1
['11', '22', '555']
>>> li1.remove('3')
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
ValueError: list.remove(x): x not in list

reverse()
反转列表中所有值的顺序

>>> li1
['11', '22', '555']
>>> li1.reverse()
>>> li1
['555', '22', '11']

sort()
列表排序,数字按照数值大小比较,字母按照ASC码来比较,中文按照unicode来比较

>>> li2=['1','22','6']
>>> li2.sort()
>>> li2
['1', '22', '6']
>>> li3=[1,22,6]
>>> li3.sort()
>>> li3
[1, 6, 22]

列表的所有内置方法:

| Methods defined here:
|
| __add__(...)
| x.__add__(y) <==> x+y
|
| __contains__(...)
| x.__contains__(y) <==> y in x
|
| __delitem__(...)
| x.__delitem__(y) <==> del x[y]
|
| __delslice__(...)
| x.__delslice__(i, j) <==> del x[i:j]
|
| Use of negative indices is not supported.
|
| __eq__(...)
| x.__eq__(y) <==> x==y
|
| __ge__(...)
| x.__ge__(y) <==> x>=y
|
| __getattribute__(...)
| x.__getattribute__('name') <==> x.name
|
| __getitem__(...)
| x.__getitem__(y) <==> x[y]
|
| __getslice__(...)
| x.__getslice__(i, j) <==> x[i:j]
|
| Use of negative indices is not supported.
|
| __gt__(...)
| x.__gt__(y) <==> x>y
|
| __iadd__(...)
| x.__iadd__(y) <==> x+=y
|
| __imul__(...)
| x.__imul__(y) <==> x*=y
|
| __init__(...)
| x.__init__(...) initializes x; see help(type(x)) for signature
|
| __iter__(...)
| x.__iter__() <==> iter(x)
|
| __le__(...)
| x.__le__(y) <==> x<=y
|
| __len__(...)
| x.__len__() <==> len(x)
|
| __lt__(...)
| x.__lt__(y) <==> x<y
|
| __mul__(...)
| x.__mul__(n) <==> x*n
|
| __ne__(...)
| x.__ne__(y) <==> x!=y
|
| __repr__(...)
| x.__repr__() <==> repr(x)
|
| __reversed__(...)
| L.__reversed__() -- return a reverse iterator over the list
|
| __rmul__(...)
| x.__rmul__(n) <==> n*x
|
| __setitem__(...)
| x.__setitem__(i, y) <==> x[i]=y
|
| __setslice__(...)
| x.__setslice__(i, j, y) <==> x[i:j]=y
|
| Use of negative indices is not supported.
|
| __sizeof__(...)
| L.__sizeof__() -- size of L in memory, in bytes
|
| append(...)
| L.append(object) -- append object to end
|
| count(...)
| L.count(value) -> integer -- return number of occurrences of value
|
| extend(...)
| L.extend(iterable) -- extend list by appending elements from the iterable
|
| index(...)
| L.index(value, [start, [stop]]) -> integer -- return first index of value.
| Raises ValueError if the value is not present.
|
| insert(...)
| L.insert(index, object) -- insert object before index
|
| pop(...)
| L.pop([index]) -> item -- remove and return item at index (default last).
| Raises IndexError if list is empty or index is out of range.
|
| remove(...)
| L.remove(value) -- remove first occurrence of value.
| Raises ValueError if the value is not present.
|
| reverse(...)
| L.reverse() -- reverse *IN PLACE*
|
| sort(...)
| L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*;
| cmp(x, y) -> -1, 0, 1
|
| ----------------------------------------------------------------------
| Data and other attributes defined here:
|
| __hash__ = None
|
| __new__ = <built-in method __new__ of type object>
| T.__new__(S, ...) -> a new object with type S, a subtype of T

本文出处:http://zengestudy.blog.51cto.com/1702365/1790810
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息