zoukankan      html  css  js  c++  java
  • python中列表


    列表可以存储多个值 可读可修改

    #remove 删除指定元素

    >>> list1 = ['a','b','c','a']
    >>> list1.remove('b')
    >>> print(list1)
    ['a', 'c', 'a']

    #append 追加元素

    >>> list1 = ['a','b','c','a']
    >>> list1.append(['1','2','3'])
    >>> print(list1)
    ['a', 'b', 'c', 'a', ['1', '2', '3']]

    #列表可以相加,可以和数字相乘

    >>> a = ['1','2','3']
    >>> b = ['3','4','5']
    >>> print(a+b)
    ['1', '2', '3', '3', '4', '5']
    >>> a = ['1','2','3']
    >>> print(a*2)
    ['1', '2', '3', '1', '2', '3']

    #[ ] 按照索引取出单个元素 如果没有报错

    >>> list1 = ['a','b','c','a']
    >>> print(list1[1])
    b

    #列表转换成字典:

    >>> i = ['a','b']
    >>> print(dict([i]))
    {'a': 'b'}

    #reverse 反转 倒序

    >>> list1 = ['a','b','c','a']
    >>> list1.reverse()
    >>> print(list1)
    ['a', 'c', 'b', 'a']

    #count 统计

    >>> list1 = ['a','b','c','a']
    >>> res = list1.count('a')
    >>> print(res)
    2

    #index 取元素索引

    >>> list1 = ['a','b','c','a']
    >>> res = list1.index('a')
    >>> print(res)
    0

    #clear 清除

    >>> list1 = ['a','b','c','a']
    >>> res = list1.clear()
    >>> print(list1)
    []

    #pop 根据指定索引剪切元素

    >>> list1 = ['a','b','c','a']
    >>> res = list1.pop(1)
    >>> print(res)
    b

    #sort 排序

    >>> list1 = ['a','b','c','a']
    >>> list1.sort()
    >>> print(list1)
    ['a', 'a', 'b', 'c']

    #extend 增加元素列表

    >>> list1 = ['a','b','c','a']
    >>> list1.extend(['1','2','3'])
    >>> print(list1)
    ['a', 'b', 'c', 'a', '1', '2', '3']

    #insert 按照指定索引位置插入元素

    >>> list1 = ['a','b','c','a']
    >>> list1.insert(2,'天明')
    >>> print(list1)
    ['a', 'b', '天明', 'c', 'a']
  • 相关阅读:
    BZOJ 3709: [PA2014]Bohater
    BZOJ 3689: 异或之
    BZOJ 4385: [POI2015]Wilcze doły
    2017-2018 ACM-ICPC German Collegiate Programming Contest (GCPC 2017) Solution
    Codeforces Round #522 (Div. 2, based on Technocup 2019 Elimination Round 3) Solution
    BZOJ 4320: ShangHai2006 Homework
    BZOJ 4318: OSU!
    2016-2017 ACM-ICPC CHINA-Final Solution
    BZOJ 5312: 冒险
    Codeforces Round #520 (Div. 2) Solution
  • 原文地址:https://www.cnblogs.com/t-ym/p/11824532.html
Copyright © 2011-2022 走看看