coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 03:11:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
算法题（国内版）/problem (English)/稀疏数组搜索(English) [sparse-array-search-lcci].html Normal file
View File

@@ -0,0 +1,22 @@
<p>Given a sorted array of strings that is interspersed with empty strings, write a method to find the location of a given string.</p>
<p><strong>Example1:</strong></p>
<pre>
<strong> Input</strong>: words = [&quot;at&quot;, &quot;&quot;, &quot;&quot;, &quot;&quot;, &quot;ball&quot;, &quot;&quot;, &quot;&quot;, &quot;car&quot;, &quot;&quot;, &quot;&quot;,&quot;dad&quot;, &quot;&quot;, &quot;&quot;], s = &quot;ta&quot;
<strong> Output</strong>: -1
<strong> Explanation</strong>: Return -1 if <code>s</code> is not in <code>words</code>.
</pre>
<p><strong>Example2:</strong></p>
<pre>
<strong> Input</strong>: words = [&quot;at&quot;, &quot;&quot;, &quot;&quot;, &quot;&quot;, &quot;ball&quot;, &quot;&quot;, &quot;&quot;, &quot;car&quot;, &quot;&quot;, &quot;&quot;,&quot;dad&quot;, &quot;&quot;, &quot;&quot;], s = &quot;ball&quot;
<strong> Output</strong>: 4
</pre>
<p><strong>Note:</strong></p>
<ol>
<li><code>1 &lt;= words.length &lt;= 1000000</code></li>
</ol>