leetcode-problemset/leetcode-cn/problem (English)/稀疏数组搜索(English) [sparse-array-search-lcci].html

<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>