Web Crawler

Implement a webpage Crawler to crawl webpages of http://www.wikipedia.org/. To simplify the question, let's use url instead of the the webpage content.

Your crawler should:

  1. Call HtmlHelper.parseUrls(url) to get all urls from a webpage of given url.
  2. Only crawl the webpage of wikipedia.
  3. Do not crawl the same webpage twice.
  4. Start from the homepage of wikipedia: http://www.wikipedia.org/

Example

Example 1

Input:
    "http://www.wikipedia.org/": ["http://www.wikipedia.org/help/"]
    "http://www.wikipedia.org/help/": []
Output: ["http://www.wikipedia.org/", "http://www.wikipedia.org/help/"]

思路:就是用queue,bfs,不过要用多线程写,我抄的答案; 

/**
 * public class HtmlHelper {
 *     public static List<String> parseUrls(String url);
 *         // Get all urls from a webpage of given url. 
 * }
 */
 
import java.util.*;
import java.util.concurrent.*;
import java.util.concurrent.atomic.*;
import java.util.concurrent.locks.*;
import java.net.*;

public class Solution {
    /**
     * @param url: a url of root page
     * @return: all urls
     */
    
    ExecutorService pool = Executors.newFixedThreadPool(4);
    AtomicLong numTasks = new AtomicLong(0);
    Lock lock = new ReentrantLock();
    List<String> result = new ArrayList<String>();
    Set<String> visited = new HashSet<>();
    
    private class crawlTask implements Runnable {
        String url;
        public crawlTask(String url) {
            this.url = url;
        }
        
        @Override
        public void run() {
            try {
                for(String neighbor: HtmlHelper.parseUrls(url)) {
                    URL neighborURL = new URL(neighbor);
                    if(!neighborURL.getHost().endsWith("wikipedia.org")) {
                        continue;
                    }
                    lock.lock();
                    if(!visited.contains(neighbor)) {
                        visited.add(neighbor);
                        result.add(neighbor);
                        pool.execute(new crawlTask(neighbor));
                        numTasks.incrementAndGet();
                    }
                    lock.unlock();
                }
                
            } catch (Exception e) {
                e.printStackTrace();
            } finally {
                numTasks.decrementAndGet();
            }
        }
    }
     
    public List<String> crawler(String url) {
        visited.add(url);
        result.add(url);
        pool.execute(new crawlTask(url));
        numTasks.incrementAndGet();
        try{
            while(numTasks.get() != 0){
                Thread.sleep(10);
            } 
        } catch (Exception e) {
            e.printStackTrace();
        }
        pool.shutdown();
        return result;
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值