zoukankan      html  css  js  c++  java
  • [Python] Optimizing code with numpy intersect1d, and Set

    import time
    import pandas as pd
    import numpy as np
    with open('books_published_last_two_years.txt') as f:
        recent_books = f.read().split('
    ')
        
    with open('all_coding_books.txt') as f:
        coding_books = f.read().split('
    ')
    start
    = time.time() recent_coding_books = [] for book in recent_books: if book in coding_books: recent_coding_books.append(book) print(len(recent_coding_books)) print('Duration: {} seconds'.format(time.time() - start))

    Tip #1: Use vector operations over loops when possible

    Use numpy's `intersect1d` method to get the intersection of the `recent_books` and `coding_books` arrays.

    start = time.time()
    recent_coding_books = np.intersect1d(recent_books, coding_books)
    print(len(recent_coding_books))
    print('Duration: {} seconds'.format(time.time() - start))

    Tip #2: Know your data structures and which methods are faster
    Use the set's `intersection` method to get the common elements in `recent_books` and `coding_books`.

    start = time.time()
    recent_coding_books =  set(recent_books).intersection(coding_books)
    print(len(recent_coding_books))
    print('Duration: {} seconds'.format(time.time() - start))
  • 相关阅读:
    YAOI Summer Round #4 (Div.2) 题解
    2021 暑假集训(福建师大附中)
    YAOI Round #7 题解
    YAOI Round #5 题解
    插头DP
    四边形不等式
    YAOI Round #3 题解
    关于 2020 年
    图论相关性质和结论(基础)
    斜率优化 DP :Luogu P2365 P5785「SDOI2012」任务安排 & 弱化版
  • 原文地址:https://www.cnblogs.com/Answer1215/p/12943433.html
Copyright © 2011-2022 走看看