V2EX = way to explore
V2EX 是一个关于分享和探索的地方
Sign Up Now
For Existing Member Sign In
推荐学习书目
› Learn Python the Hard Way
Python Sites
› PyPI - Python Package Index
› http://diveintopython.org/toc/index.html
› Pocoo
值得关注的项目
› PyPy
› Celery
› Jinja2
› Read the Docs
› gevent
› pyenv
› virtualenv
› Stackless Python
› Beautiful Soup
› 结巴中文分词
› Green Unicorn
› Sentry
› Shovel
› Pyflakes
› pytest
Python 编程
› pep8 Checker
Styles
› PEP 8
› Google Python Style Guide
› Code Style from The Hitchhiker's Guide
This topic created in 1482 days ago, the information mentioned may be changed or developed.
大概代码如下，其中主列表 full_queue 有 5000 个元素，做差集的列表有 50 个左右，计算下来耗时大概 100 多 ms ，有什么方法或者第三方包可以优化这部分的执行时间？
from datetime import datetime
process_start = datetime.now().timestamp()
full_queue = [4878214304830001, 4878214304830002, 4878214304830003, 4878214304830004, ...]
diff_queue = [4878214548209665, 4878214308487169, 4878265720848385, ...]
format_list = list(set(full_queue)-set(diff_queue))
format_list.sort(key=full_queue.index)
print(format_list[:5])
process_elapsed = round(datetime.now().timestamp() - process_start, 4) * 1000
print(process_elapsed)
Select Language