1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

This commit is contained in:
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions

View File

@@ -1,22 +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>
<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>