mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
13 lines
665 B
HTML
13 lines
665 B
HTML
|
<p>有个内含单词的超大文本文件，给定任意两个单词，找出在这个文件中这两个单词的最短距离(相隔单词数)。如果寻找过程在这个文件中会重复多次，而每次寻找的单词不同，你能对此优化吗?</p>
|
||
|
|
|
||
|
|
<p><strong>示例：</strong></p>
|
||
|
|
|
||
|
|
<pre><strong>输入：</strong>words = ["I","am","a","student","from","a","university","in","a","city"], word1 = "a", word2 = "student"
|
||
|
|
<strong>输出：</strong>1</pre>
|
||
|
|
|
||
|
|
<p>提示：</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>words.length <= 100000</code></li>
|
||
|
|
</ul>
|