zoukankan      html  css  js  c++  java
  • 网络爬虫练习

    网页

    <!DOCTYPE html>
    <html lang="en">
    <head>
        <meta charset="UTF-8">
        <title>Simple DOM Demo</title>
    </head>
    
    <body>
        <h1>This is the document body</h1>
        <P ID = "p1Node">This is paragraph 1.</P>
        <P ID = "p2Node">段落2</P>
        <a href="http://www.gzcc.cn/">广州商学院</a>
        <li>
            <a href="http://news.gzcc.cn/html/2018/xiaoyuanxinwen_0328/9113.html">
                <div class="news-list-thumb"><img src="http://oa.gzcc.cn/uploadfile/2018/0328/20180328085249565.jpg"/></div>
                <div class="news-list-text">
                    <div class="news-list-title" style="">我校校长杨文轩教授讲授新学期“思政第一课”</div>
                    <div class="news-list-description">3月27日下午,我校校长杨文轩教授在第四教学楼310室为学生讲授了新学期“思政第一课”。</div>
                    <div class="news-list-info"><span><i class="fa fa-clock-o"></i>2018-03-28</span><span><i class="fa fa-building-o"></i>马克思主义学院</span></div>
                </div>
            </a>
        </li>
    
    </body>
    </html>

    练习

    url='http://localhost:63342/bd/0328.html?_ijt=h9b41m2eup4kmk1cet0l4ai05j'
    import requests
    from bs4 import BeautifulSoup
    res=requests.get(url)
    res.encoding='utf-8'
    print(type(res))
    
    soup=BeautifulSoup(res.text,'html.parser')
    print(type(soup))
    
    print(soup.a.attrs['href'])
    
    print(soup.li.text)
    
    print(soup.select('.news-list-title'))
    print(soup.a.attrs['href'])
    print(soup.select('fa fa-clock-o'))
    print(soup.select('fa fa-building-o')
  • 相关阅读:
    LeetCode 297. 二叉树的序列化与反序列化
    LeetCode 14. 最长公共前缀
    LeetCode 1300. 转变数组后最接近目标值的数组和
    bigo一面凉经
    LeetCode 128.最长连续序列
    LeetCode中二分查找算法的变种
    LeetCode 93. 复原IP地址
    LeetCode 1004. 最大连续1的个数 III
    LeetCode 1282. 用户分组
    多线程理解
  • 原文地址:https://www.cnblogs.com/0056a/p/8678569.html
Copyright © 2011-2022 走看看