序列是Python中最基本的資料結構。序列中的每個元素都有索引，第一個索引是0，第二個索引是1，依此類推。從後面數的話，倒數第一個元素索引是-1。


下面是list的一些基本功能：

增：

append()追加

num_list = [1, 2, 3, 4, 5, 6]  
num_list.append(7)  
print(num_list) # 輸出[1, 2, 3, 4, 5, 6, 7]

insert(索引, 內容) 插入元素：

num_list = [1, 3, 4, 5]  
num_list.insert(1, 2)  
print(num_list) # 輸出[1, 2, 3, 4, 5]

extend() 擴充套件：

num_list = [1, 2, 3, 4]  
num_list2 = [5, 6, 7]  
num_list.extend(num_list2)  
print(num_list) # 輸出[1, 2, 3, 4, 5, 6, 7]  
 

直接相加（將兩個list相加，會返回到一個新的list物件）：

num_list = [1, 2, 3, 4]  
num_list2 = [5, 6, 7]  
num_list3 = num_list + num_list2  
print(num_list) # 輸出[1, 2, 3, 4]  
print(num_list2) # 輸出[5, 6, 7]  
print(num_list3) # 輸出[1, 2, 3, 4, 5, 6, 7]  

刪：

remove() 移除某個指定值的元素：

num_list = [1, 2, 3, 4]  
num_list.remove(3)  
print(num_list) # 輸出[1, 2, 4]  
 

pop(index)移除列表中的一個元素（預設最後一個元素），並且返回該元素的值：

num_list = [1, 2, 3, 4]  
return_num = num_list.pop()  
print(num_list) # 輸出[1, 2, 3]  
print(return_num) # 輸出4  
  
num_list2 = [1, 2, 3, 4]  
return_num2 = num_list2.pop(2)  
print(num_list2) # 輸出[1, 2, 4]  
print(return_num2) # 輸出3 

del() 刪除：

num_list = [1, 2, 3, 4]  
del(num_list[1])  
print(num_list) # 輸出[1, 3, 4]  
 

clear() 清空：

num_list = [1, 2, 3, 4]  
num_list.clear()  
print(num_list) # 輸出[]  

改：

通過索引修改值：

num_list = [1, 2, 3, 4]  
num_list[2] = 5  
print(num_list) # 輸出[1, 2, 5, 4]

通過切片修改值：

num_list = [1, 2, 3, 4]  
num_list[1:3] = [5, 6, 7]  
print(num_list) # 輸出 [1, 5, 6, 7, 4] 

查：

通過索引獲取值：

num_list = [1, 2, 3, 4]  
num = num_list[2]  
print(num) # 輸出3  

切片（切片的特點是顧頭不顧尾）：

num_list = [1, 2, 3, 4, 5, 6]  
num = num_list[2:4]  
print(num) # 輸出[3, 4]

count() 統計元素出現的次數：

num_list = [1, 2, 3, 4, 3, 6]  
print(num_list.count(3)) # 輸出2  

index() 獲取元素的索引，可指定列表起始位置：

num_list = [1, 2, 3, 4, 3, 6]  
print(num_list.index(3)) # 輸出2  
print(num_list.index(3, 3, 5)) # 輸出4  

用 in 查詢list是否包含某元素

num_list = [1, 2, 3, 4]  
print(2 in num_list) # 輸出True  
print(5 in num_list) # 輸出False  

其他：

len() 獲取list的長度：

num_list = [1, 2, 3, 4, 5, 6]  
print(len(num_list)) # 輸出 6  

迴圈list：

num_list = [1, 2, 3, 4]  
for i in num_list:  
    print(i)  
'''
輸出: 
1 
2 
3 
4 
'''  

reverse()反轉list：

num_list = [1, 2, 3, 4]  
num_list.reverse()  
print(num_list) # 輸出 [4, 3, 2, 1]  

sort()排序：

num_list = [4, 5, 2, 1, 3, 6, 8, 7]  
num_list.sort() # 從小到大  
print(num_list) # 輸出[1, 2, 3, 4, 5, 6, 7, 8]  
  
num_list = [4, 5, 2, 1, 3, 6, 8, 7]  
num_list.sort(reverse=True) # 從大到小  
print(num_list) # 輸出[8, 7, 6, 5, 4, 3, 2, 1]  

下面是list的原始碼：

class list(object):  
    """ 
    list() -> new empty list 
    list(iterable) -> new list initialized from iterable's items 
    """  
    def append(self, p_object): # real signature unknown; restored from __doc__  
        """ L.append(object) -> None -- append object to end """  
        pass  
  
    def clear(self): # real signature unknown; restored from __doc__  
        """ L.clear() -> None -- remove all items from L """  
        pass  
  
    def copy(self): # real signature unknown; restored from __doc__  
        """ L.copy() -> list -- a shallow copy of L """  
        return []  
  
    def count(self, value): # real signature unknown; restored from __doc__  
        """ L.count(value) -> integer -- return number of occurrences of value """  
        return 0  
  
    def extend(self, iterable): # real signature unknown; restored from __doc__  
        """ L.extend(iterable) -> None -- extend list by appending elements from the iterable """  
        pass  
  
    def index(self, value, start=None, stop=None): # real signature unknown; restored from __doc__  
        """ 
        L.index(value, [start, [stop]]) -> integer -- return first index of value. 
        Raises ValueError if the value is not present. 
        """  
        return 0  
  
    def insert(self, index, p_object): # real signature unknown; restored from __doc__  
        """ L.insert(index, object) -- insert object before index """  
        pass  
  
    def pop(self, index=None): # real signature unknown; restored from __doc__  
        """ 
        L.pop([index]) -> item -- remove and return item at index (default last). 
        Raises IndexError if list is empty or index is out of range. 
        """  
        pass  
  
    def remove(self, value): # real signature unknown; restored from __doc__  
        """ 
        L.remove(value) -> None -- remove first occurrence of value. 
        Raises ValueError if the value is not present. 
        """  
        pass  
  
    def reverse(self): # real signature unknown; restored from __doc__  
        """ L.reverse() -- reverse *IN PLACE* """  
        pass  
  
    def sort(self, key=None, reverse=False): # real signature unknown; restored from __doc__  
        """ L.sort(key=None, reverse=False) -> None -- stable sort *IN PLACE* """  
        pass  
  
    def __add__(self, *args, **kwargs): # real signature unknown  
        """ Return self+value. """  
        pass  
  
    def __contains__(self, *args, **kwargs): # real signature unknown  
        """ Return key in self. """  
        pass  
  
    def __delitem__(self, *args, **kwargs): # real signature unknown  
        """ Delete self[key]. """  
        pass  
  
    def __eq__(self, *args, **kwargs): # real signature unknown  
        """ Return self==value. """  
        pass  
  
    def __getattribute__(self, *args, **kwargs): # real signature unknown  
        """ Return getattr(self, name). """  
        pass  
  
    def __getitem__(self, y): # real signature unknown; restored from __doc__  
        """ x.__getitem__(y) <==> x[y] """  
        pass  
  
    def __ge__(self, *args, **kwargs): # real signature unknown  
        """ Return self>=value. """  
        pass  
  
    def __gt__(self, *args, **kwargs): # real signature unknown  
        """ Return self>value. """  
        pass  
  
    def __iadd__(self, *args, **kwargs): # real signature unknown  
        """ Implement self+=value. """  
        pass  
  
    def __imul__(self, *args, **kwargs): # real signature unknown  
        """ Implement self*=value. """  
        pass  
  
    def __init__(self, seq=()): # known special case of list.__init__  
        """ 
        list() -> new empty list 
        list(iterable) -> new list initialized from iterable's items 
        # (copied from class doc) 
        """  
        pass  
  
    def __iter__(self, *args, **kwargs): # real signature unknown  
        """ Implement iter(self). """  
        pass  
  
    def __len__(self, *args, **kwargs): # real signature unknown  
        """ Return len(self). """  
        pass  
  
    def __le__(self, *args, **kwargs): # real signature unknown  
        """ Return self<=value. """  
        pass  
  
    def __lt__(self, *args, **kwargs): # real signature unknown  
        """ Return self<value. """  
        pass  
  
    def __mul__(self, *args, **kwargs): # real signature unknown  
        """ Return self*value.n """  
        pass  
 
    @staticmethod # known case of __new__  
    def __new__(*args, **kwargs): # real signature unknown  
        """ Create and return a new object.  See help(type) for accurate signature. """  
        pass  
  
    def __ne__(self, *args, **kwargs): # real signature unknown  
        """ Return self!=value. """  
        pass  
  
    def __repr__(self, *args, **kwargs): # real signature unknown  
        """ Return repr(self). """  
        pass  
  
    def __reversed__(self): # real signature unknown; restored from __doc__  
        """ L.__reversed__() -- return a reverse iterator over the list """  
        pass  
  
    def __rmul__(self, *args, **kwargs): # real signature unknown  
        """ Return self*value. """  
        pass  
  
    def __setitem__(self, *args, **kwargs): # real signature unknown  
        """ Set self[key] to value. """  
        pass  
  
    def __sizeof__(self): # real signature unknown; restored from __doc__  
        """ L.__sizeof__() -- size of L in memory, in bytes """  
        pass  
  
    __hash__ = None