zoukankan      html  css  js  c++  java
  • c#采集网页用得几个函数

    代码
    public  string GetHtmlSource(string Url, string charset)
            {
                
    if (charset == "" || charset == null) charset = "gb2312";
                
    string text1 = "";
                
    try
                {
                    HttpWebRequest request1 
    = (HttpWebRequest)WebRequest.Create(Url);
                    HttpWebResponse response1 
    = (HttpWebResponse)request1.GetResponse();
                    Stream stream1 
    = response1.GetResponseStream();
                    StreamReader reader1 
    = new StreamReader(stream1, Encoding.GetEncoding(charset));
                    text1 
    = reader1.ReadToEnd();
                    stream1.Close();
                    response1.Close();
                }
                
    catch (Exception exception1)
                {
                }
                
    return text1;
            }

     
    public string SniffwebCode(string code, string wordsBegin, string wordsEnd)
            {
                
    string NewsTitle = "";
                Regex regex1 
    = new Regex("" + wordsBegin + @"(?<title>[\s\S]+?)" + wordsEnd + "", RegexOptions.Compiled | RegexOptions.IgnoreCase);
                
    for (Match match1 = regex1.Match(code); match1.Success; match1 = match1.NextMatch())
                {
                    NewsTitle 
    = match1.Groups["title"].ToString();
                }
                
    return NewsTitle;

            }

    public ArrayList SniffwebCodeReturnList(string code, string wordsBegin, string wordsEnd)
            {
                ArrayList urlList 
    = new ArrayList();
                
    //string NewsTitle = "";
                Regex regex1 = new Regex("" + wordsBegin + @"(?<title>[\s\S]+?)" + wordsEnd + "", RegexOptions.Compiled | RegexOptions.IgnoreCase);
                
    for (Match match1 = regex1.Match(code); match1.Success; match1 = match1.NextMatch())
                {
                    urlList.Add(match1.Groups[
    "title"].ToString());
                }
                
    return urlList;

            }
  • 相关阅读:
    codeforces 671B Robin Hood 二分
    HDU 4009 Transfer water 最小树形图
    HDU 2121 Ice_cream’s world II 最小树形图
    UVA1395 Slim Span(枚举最小生成树)
    ZOJ 1107FatMouse and Cheese(BFS)
    POJ2239 Selecting Courses(二分图最大匹配)
    UVA 11419SAM I AM(输出 最小覆盖点 )
    POJ 3678 Katu Puzzle(强连通 法)
    POJ3207Ikki's Story IV
    POJ1236Network of Schools(强连通分量 + 缩点)
  • 原文地址:https://www.cnblogs.com/hantianwei/p/1706444.html
Copyright © 2011-2022 走看看