mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
41 lines
1.7 KiB
HTML
41 lines
1.7 KiB
HTML
|
<p>You are given a <strong>0-indexed</strong> array of strings <code>words</code> and a character <code>x</code>.</p>
|
||
|
|
|
||
|
|
<p>Return <em>an <strong>array of indices</strong> representing the words that contain the character </em><code>x</code>.</p>
|
||
|
|
|
||
|
|
<p><strong>Note</strong> that the returned array may be in <strong>any</strong> order.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["leet","code"], x = "e"
|
||
|
|
<strong>Output:</strong> [0,1]
|
||
|
|
<strong>Explanation:</strong> "e" occurs in both words: "l<strong><u>ee</u></strong>t", and "cod<u><strong>e</strong></u>". Hence, we return indices 0 and 1.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["abc","bcd","aaaa","cbc"], x = "a"
|
||
|
|
<strong>Output:</strong> [0,2]
|
||
|
|
<strong>Explanation:</strong> "a" occurs in "<strong><u>a</u></strong>bc", and "<u><strong>aaaa</strong></u>". Hence, we return indices 0 and 2.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["abc","bcd","aaaa","cbc"], x = "z"
|
||
|
|
<strong>Output:</strong> []
|
||
|
|
<strong>Explanation:</strong> "z" does not occur in any of the words. Hence, we return an empty array.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= words.length <= 50</code></li>
|
||
|
|
<li><code>1 <= words[i].length <= 50</code></li>
|
||
|
|
<li><code>x</code> is a lowercase English letter.</li>
|
||
|
|
<li><code>words[i]</code> consists only of lowercase English letters.</li>
|
||
|
|
</ul>
|