blocks|key|364164|text|Perl解决方案|type|unstyled|depth|inlineStyleRanges|entityRanges|data|364165|由："MH“通过codinghorror，com于2008年9月5日07:29+AM|364166|#!/usr/bin/perl
while+(<*.html>)+{
++++my+$filename+=+$_;
++++my+@data+++++=+<$filename>;

++++#+Loop+once+through+with+simple+search
++++while+(@data)+{
++++++++if+(/$?(\d\d\d)$?[+-]?(\d\d\d)-?(\d\d\d\d)/)+{
++++++++++++push(+@files,+$filename+);
++++++++++++next;
++++++++}
++++}

++++#+None+found,+strip+html
++++$text+=+"";
++++$text+.=+$_+while+(@data);
++++$text+=~+s#<[%5E>]%2B>##gxs;

++++#+Strip+line+breaks
++++$text+=~+s#\n%7C\r##gxs;

++++#+Check+for+occurrence.
++++if+(+$text+=~+/$?(\d\d\d)$?[+-]?(\d\d\d)-?(\d\d\d\d)/+)+{
++++++++push(+@files,+$filename+);
++++++++next;
++++}
}

#+Print+out+result
print+join(+'\n',+@files+);|code-block|syntax|javascript|364167|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

<h2>Perl Solution</h2>
By: &quot;MH&quot; via codinghorror,com on September 5, 2008 07:29 AM
<pre><code>#!/usr/bin/perl
while (&lt;*.html&gt;) {
 my $filename = $_;
 my @data = &lt;$filename&gt;;

 # Loop once through with simple search
 while (@data) {
 if (/$?(\d\d\d)$?[ -]?(\d\d\d)-?(\d\d\d\d)/) {
 push( @files, $filename );
 next;
 }
 }

 # None found, strip html
 $text = &quot;&quot;;
 $text .= $_ while (@data);
 $text =~ s#&lt;[^&gt;]+&gt;##gxs;

 # Strip line breaks
 $text =~ s#\n|\r##gxs;

 # Check for occurrence.
 if ( $text =~ /$?(\d\d\d)$?[ -]?(\d\d\d)-?(\d\d\d\d)/ ) {
 push( @files, $filename );
 next;
 }
}

# Print out result
print join( '\n', @files );
</code></pre>

blocks|key|369040|text|这是用Java做的。正则表达式是从this+forum借来的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|369041|++++final+String+regex+=+"[\\s](\${0,1}\\d{3}\${0,1}"+%2B
++++++++++++"[-+\\.]\\d{3}[-+\\.]\\d{4})%7C"+%2B
++++++++++++"(\\%2B\\d{2}-\\d{2,4}-\\d{3,4}-\\d{3,4})";
++++final+Pattern+phonePattern+=+Pattern.compile(regex);
++++
++++/*+The+result+set+*/
++++Set<File>+files+=+new+HashSet<File>();
++++
++++File+dir+=+new+File("/initDirPath");
++++if+(!dir.isDirectory())+return;
++++
++++for+(File+file+:+dir.listFiles())+{
++++++++if+(file.isDirectory())+continue;
++++++++
++++++++BufferedReader+reader+=+new+BufferedReader(new+FileReader(file));
++++++++
++++++++String+line;
++++++++boolean+found+=+false;
++++++++while+((line+=+reader.readLine())+!=+null+
++++++++++++++++&&+!found)+{
++++++++++++
++++++++++++if+(found+=+phonePattern.matcher(line).find())+{
++++++++++++++++files.add(file);
++++++++++++}
++++++++}
++++}

++++for+(File+file+:+files)+{
++++++++System.out.println(file.getAbsolutePath());
++++}|code-block|syntax|javascript|369042|执行了一些测试，结果还不错！:)请记住，我并不想在这里使用最好的设计。刚刚实现了这个算法。|369043|entityMap|0|LINK|mutability|MUTABLE|url|http://forums.msdn.microsoft.com/en-US/regexp/thread/8d4846c0-4eca-427a-b34a-856c7f8695cb/^0|H|A|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|F|7|W|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|X|8|@]|9|@]|C|$]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]]]

Made this in Java. The regex was borrowed from <a href="http://forums.msdn.microsoft.com/en-US/regexp/thread/8d4846c0-4eca-427a-b34a-856c7f8695cb/" rel="nofollow noreferrer">this forum</a>.
<pre><code> final String regex = &quot;[\\s](\${0,1}\\d{3}\${0,1}&quot; +
 &quot;[- \\.]\\d{3}[- \\.]\\d{4})|&quot; +
 &quot;(\\+\\d{2}-\\d{2,4}-\\d{3,4}-\\d{3,4})&quot;;
 final Pattern phonePattern = Pattern.compile(regex);
 
 /* The result set */
 Set&lt;File&gt; files = new HashSet&lt;File&gt;();
 
 File dir = new File(&quot;/initDirPath&quot;);
 if (!dir.isDirectory()) return;
 
 for (File file : dir.listFiles()) {
 if (file.isDirectory()) continue;
 
 BufferedReader reader = new BufferedReader(new FileReader(file));
 
 String line;
 boolean found = false;
 while ((line = reader.readLine()) != null 
 &amp;&amp; !found) {
 
 if (found = phonePattern.matcher(line).find()) {
 files.add(file);
 }
 }
 }

 for (File file : files) {
 System.out.println(file.getAbsolutePath());
 }
</code></pre>
Performed some tests and it went ok! :)
Remeber I'm not trying to use the best design here. Just implemented the algorithm for that.

blocks|key|3372990|text|egrep+"(([0-9]{1,2}.)?[0-9]{3}.[0-9]{3}.[0-9]{4})"+.+-R+--include='*.html'|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|3372991|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>egrep "(([0-9]{1,2}.)?[0-9]{3}.[0-9]{3}.[0-9]{4})" . -R --include='*.html'
</code></pre>

blocks|key|364190|text|我喜欢做这些小问题，情不自禁。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|364191|我不确定是否值得这样做，因为它与java的答案非常相似。|364192|private+readonly+Regex+phoneNumExp+=+new+Regex(@"(${0,1}\d{3}${0,1}[-+\.]\d{3}[-+\.]\d{4})%7C(\%2B\d{2}-\d{2,4}-\d{3,4}-\d{3,4})");

public+HashSet<string>+Search(string+dir)
{
++++var+numbers+=+new+HashSet<string>();

++++string[]+files+=+Directory.GetFiles(dir,+"*.html",+SearchOption.AllDirectories);

++++foreach+(string+file+in+files)
++++{
++++++++using+(var+sr+=+new+StreamReader(file))
++++++++{
++++++++++++string+line;

++++++++++++while+((line+=+sr.ReadLine())+!=+null)
++++++++++++{
++++++++++++++++var+match+=+phoneNumExp.Match(line);

++++++++++++++++if+(match.Success)
++++++++++++++++{
++++++++++++++++++++numbers.Add(match.Value);
++++++++++++++++}
++++++++++++}
++++++++}
++++}

++++return+numbers;
}|code-block|syntax|javascript|364193|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

i love doing these little problems, can't help myself.

not sure if it was worth doing though since it's very similar to the java answer.

<pre><code>private readonly Regex phoneNumExp = new Regex(@"(${0,1}\d{3}${0,1}[- \.]\d{3}[- \.]\d{4})|(\+\d{2}-\d{2,4}-\d{3,4}-\d{3,4})");

public HashSet&lt;string&gt; Search(string dir)
{
 var numbers = new HashSet&lt;string&gt;();

 string[] files = Directory.GetFiles(dir, "*.html", SearchOption.AllDirectories);

 foreach (string file in files)
 {
 using (var sr = new StreamReader(file))
 {
 string line;

 while ((line = sr.ReadLine()) != null)
 {
 var match = phoneNumExp.Match(line);

 if (match.Success)
 {
 numbers.Add(match.Value);
 }
 }
 }
 }

 return numbers;
}
</code></pre>

blocks|key|3372983|text|*.html+'(?\d{3})?-\s.?\d{3}-.\d{4}‘egrep|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3372984|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

egrep '(?\d{3})?[-\s.]?\d{3}[-.]\d{4}' *.html

blocks|key|365740|text|以下是电话面试编码问题不起作用的原因：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|365741|365742|候选人:等一下(包括电话)嘿(室友/朋友/等等，非常擅长编程的人)，你是如何在5万个HTML页面中找到电话号码的？|365743|将编码问题保存到面对面面试的早期，并使面试问题更个人化，例如这是一个要求他们详细说明的问题，而且很难让其他人为你回答这个问题，而不是在电话里听起来很奇怪。|365744|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|J|8|@]|9|@]|A|$]]|$1|C|3|D|5|6|7|K|8|@]|9|@]|A|$]]|$1|E|3|F|5|6|7|L|8|@]|9|@]|A|$]]|$1|G|3|-4|5|6|7|M|8|@]|9|@]|A|$]]]|H|$]]

Here's why phone interview coding questions don't work: 

phone screener: how do you find the phone numbers in 50,000 HTML pages?

candidate: hang on one second (covers phone) hey (roommate/friend/etc who's super good at programming), how do you find the phone numbers in 50,000 HTML pages?

Save the coding questions for early in the in-person interview, and make the interview questions more personal, i.e. "I'd like details about the last time you solved a problem using code". That's a question that will beg follow-ups to their details and it's a lot harder to get someone else to answer it for you without sounding weird over the phone.

blocks|key|365752|text|借用sieben的C#答案中的两件事，这里是一小段F#代码片段，可以完成这项工作。它所缺少的就是一种调用processDirectory的方法，而这是有意省略的:)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|365753|open+System
open+System.IO
open+System.Text.RegularExpressions

let+rgx+=+Regex(@"(${0,1}\d{3}${0,1}[-+\.]\d{3}[-+\.]\d{4})%7C(\%2B\d{2}-\d{2,4}-\d{3,4}-\d{3,4})",+RegexOptions.Compiled)

let+processFile+contents+=+contents+%7C>+rgx.Matches+%7C>+Seq.cast+%7C>+Seq.map(fun+m+->+m.Value)

let+processDirectory+path+=+Directory.GetFiles(path,+"*.html",+SearchOption.AllDirectories)+%7C>+Seq.map(File.ReadAllText+>>+processFile)+%7C>+Seq.concat|code-block|syntax|javascript|365754|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Borrowing 2 things from the C# answer from sieben, here's a little F# snippet that will do the job. All it's missing is a way to call processDirectory, which is left out intentionally :)

<pre><code>
open System
open System.IO
open System.Text.RegularExpressions

let rgx = Regex(@"(${0,1}\d{3}${0,1}[- \.]\d{3}[- \.]\d{4})|(\+\d{2}-\d{2,4}-\d{3,4}-\d{3,4})", RegexOptions.Compiled)

let processFile contents = contents |> rgx.Matches |> Seq.cast |> Seq.map(fun m -> m.Value)

let processDirectory path = Directory.GetFiles(path, "*.html", SearchOption.AllDirectories) |> Seq.map(File.ReadAllText >> processFile) |> Seq.concat
</code></pre>

blocks|key|3160454|text|下面是一个改进的正则表达式模式|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3160455|$?\d{3}$?[-\s\.]?\d{3}[-\s\.]?\d{4}|code-block|syntax|javascript|3160456|它能够识别几种数字格式|3160457|3160458|xxx.xxx.xxxx|ordered-list-item|3160459|xxx.xxxxxxx|3160460|xxx-xxx-xxx|3160461|xxxxxxxxxx|3160462|(xxx)+xxx+xxxx+|3160463|(xxx)+xxx-xxxx|3160464|(xxx)xxx-xxxx|3160465|3160466|entityMap^0|0|0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|12|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|13|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|14|8|@]|9|@]|A|$]]|$1|J|3|K|5|L|7|15|8|@]|9|@]|A|$]]|$1|M|3|N|5|L|7|16|8|@]|9|@]|A|$]]|$1|O|3|P|5|L|7|17|8|@]|9|@]|A|$]]|$1|Q|3|R|5|L|7|18|8|@]|9|@]|A|$]]|$1|S|3|T|5|L|7|19|8|@]|9|@]|A|$]]|$1|U|3|V|5|L|7|1A|8|@]|9|@]|A|$]]|$1|W|3|X|5|L|7|1B|8|@]|9|@]|A|$]]|$1|Y|3|-4|5|6|7|1C|8|@]|9|@]|A|$]]|$1|Z|3|-4|5|6|7|1D|8|@]|9|@]|A|$]]]|10|$]]

Here is a improved regex pattern

<pre><code>$?\d{3}$?[-\s\.]?\d{3}[-\s\.]?\d{4}
</code></pre>

It is able to identify several number formats

<ol>
<li>xxx.xxx.xxxx</li>
<li>xxx.xxxxxxx</li>
<li>xxx-xxx-xxx</li>
<li>xxxxxxxxxx</li>
<li>(xxx) xxx xxxx </li>
<li>(xxx) xxx-xxxx</li>
<li>(xxx)xxx-xxxx</li>
</ol>

<h2>How do you find the phone numbers in 50,000 HTML pages? </h2>

<blockquote>
 <h3>Jeff Attwood posted 5 Questions for programmers applying for jobs:</h3>
 
 In an effort to make life simpler for phone screeners, I've put together
 this list of Five Essential Questions
 that you need to ask during an SDE
 screen. They won't guarantee that your
 candidate will be great, but they will
 help eliminate a huge number of
 candidates who are slipping through
 our process today.
 
 1) Coding The candidate has to write
 some simple code, with correct syntax,
 in C, C++, or Java.
 
 2) OO design The candidate has to
 define basic OO concepts, and come up
 with classes to model a simple
 problem.
 
 3) Scripting and regexes The
 candidate has to describe how to find
 the phone numbers in 50,000 HTML
 pages.
 
 4) Data structures The candidate has
 to demonstrate basic knowledge of the
 most common data structures.
 
 5) Bits and bytes The candidate has
 to answer simple questions about bits,
 bytes, and binary numbers.
 
 Please understand: what I'm looking
 for here is a total vacuum in one of
 these areas. It's OK if they struggle
 a little and then figure it out. It's
 OK if they need some minor hints or
 prompting. I don't mind if they're
 rusty or slow. What you're looking for
 is candidates who are utterly
 clueless, or horribly confused, about
 the area in question.
 
 <a href="http://www.codinghorror.com/blog/archives/001042.html" rel="noreferrer">>>> The Entirety of Jeff´s Original Post &lt;&lt;&lt;</a>
</blockquote>

 
Note: Steve Yegge originally posed the Question.

Finding the phone numbers in 50,000 HTML pages

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

如何在50,000个HTML页面中查找电话号码？为了使电话筛选器的工作变得更简单，我列出了在SDE屏幕上您需要问的五个基本问题。他们不能保证你的候选人会很棒，但他们将帮助淘汰大量的候选人，这些候选人今天正在通过我们的过程。1) 编码应聘者必须用C、C++或Java写一些简单的、语法正确的代码。2) OO设计候选人必须定...

问在50,000个HTML页面中查找电话号码
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问在50,000个HTML页面中查找电话号码EN