zoukankan      html  css  js  c++  java
  • java爬虫简单实现

    package WebSpider;

    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.net.MalformedURLException;
    import java.net.URL;
    import java.nio.charset.Charset;
    import java.util.regex.Matcher;
    import java.util.regex.Pattern;

    /**

    • 网络爬虫
    • @author Vcanccc

    /
    public class WebSpiderTest {
    /
    *
    * 获得urlStr对应网络内容
    * @param urlStr
    * @return
    */
    public static String getURLContent(String urlStr, String charset){
    StringBuilder sb = new StringBuilder();
    try {
    URL url = new URL(urlStr);
    BufferedReader reader = new BufferedReader(new InputStreamReader(url.openStream(),Charset.forName(charset)));
    String temp = "";
    while((temp = reader.readLine()) != null)
    {
    sb.append(temp);
    }
    } catch (MalformedURLException e) {
    e.printStackTrace();
    } catch (IOException e) {
    e.printStackTrace();
    }
    return sb.toString();
    }

    public static void main(String[] args) {
        String destStr = getURLContent("https://www.taobao.com","utf-8");
        
    //    Pattern p = Pattern.compile("<a[\s\S]+?</a>");
        Pattern p = Pattern.compile("href="(.+?)"");
        Matcher m = p.matcher(destStr);
        
        while(m.find()){
            System.out.println(m.group(1));
        }
    }
    

    }

  • 相关阅读:
    JS面向对象编程的实现
    初见Javascript
    详解promise
    radio单选按钮组操作
    cookie欺骗实战案例
    XSS攻击
    前端如何实现异步加载
    日常问题
    求1+2+...+n
    二叉搜索树的后序遍历序列
  • 原文地址:https://www.cnblogs.com/duende99/p/7364578.html
Copyright © 2011-2022 走看看