zoukankan      html  css  js  c++  java
  • python 爬虫,起点完结榜前100榜单

    # coding:utf-8
    from selenium import webdriver
    i = 0
    ph = 1
    driver = webdriver.Firefox()
    driver.get('https://www.qidian.com/rank/fin')  # 要打开的网页
    for r in range(5):
        books = driver.find_elements_by_class_name('book-mid-info')  # 定位包含图书介绍的div
        for book in books:
            bookall = book.text  # 获取div的text内容
            fg = bookall.split("
    ")
            print("排行:" + str(ph))
            print("书名:" + fg[0])
            print("作者:" + fg[1])
            print("简介:" + fg[6] + '
    ')
            i += 1
            ph += 1
            if ph == 101:  # 判断排行数是否到100
                driver.quit()
                exit()
            if i == 20:  # 每页20本图书,超过20后点击下一页
                driver.find_element_by_css_selector('.lbf-pagination-next').click()
                i = 0
                continue
  • 相关阅读:
    最小生成树
    图论最短路径例题
    广搜例题
    这些搜索套路好深。。。
    高斯消元part2
    高斯消元与行列式求值 part1
    2020/4/24
    实时的眼部追踪
    2020/4/23
    2020/4/22
  • 原文地址:https://www.cnblogs.com/APeng2019/p/10719296.html
Copyright © 2011-2022 走看看