zoukankan      html  css  js  c++  java
  • python四种列表的插入方法及其效率

    此篇博客是此时列表中各种方法添加数据时的效率问题,如有错误之处,望大家指出!


    coding:utf-8

    from timeit import timeit

    def count_append():
    lists = []
    for x in range(0, 100000):
    lists.append(x)

    cost_time = timeit(stmt=count_append, number=1)
    print("append花费的时间是", cost_time)

    def count_extend():
    lists = []
    for x in range(0, 100000):
    list1 = [x]
    lists.extend(list1)

    cost_time = timeit(stmt=count_extend, number=1)
    print("extend花费的时间为", cost_time)

    def count_insert():
    lists = []
    for x in range(0, 100000):
    lists.insert(x, x)

    cost_time = timeit(stmt=count_insert, number=1)
    print("insert花费的时间为", cost_time)

    def count_plus():
    lists = []
    for x in range(0, 100000):
    list1 = [x]
    lists = lists+list1

    cost_time = timeit(stmt=count_plus, number=1)
    print("plus花费的时间为", cost_time)

    append花费的时间是 0.008006025272567989

    extend花费的时间为 0.010472806737249051

    insert花费的时间为 0.012643240513279762

    plus花费的时间为 13.00245008582025

    由此可得append是耗时最短的

  • 相关阅读:
    mysql字符集设置
    mysql解压版服务启动方式
    html的表格边框为什么会这么粗?
    通过js获取tinymce4.x的值
    bzoj 3083 树链剖分
    bzoj 1143 二分图最大独立集
    bzoj 2303 并查集
    可持久化数据结构讲解
    bzoj 1072 状压DP
    bzoj 2741 可持久化trie
  • 原文地址:https://www.cnblogs.com/dxxpython/p/10995399.html
Copyright © 2011-2022 走看看