mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
更新国内版力扣题目描述变更
This commit is contained in:
@@ -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 = ["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""], s = "ta"
|
||||
<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 = ["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""], s = "ball"
|
||||
<strong> Output</strong>: 4
|
||||
</pre>
|
||||
|
||||
<p><strong>Note:</strong></p>
|
||||
|
||||
<ol>
|
||||
<li><code>1 <= words.length <= 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 = ["at", "", "", "", "ball", "", "", "car", "", "","dad", "", ""], s = "ta"
|
||||
|
||||
<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>
|
||||
|
||||
|
Reference in New Issue
Block a user