mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
41 lines
1.4 KiB
HTML
41 lines
1.4 KiB
HTML
<p>Given an array of strings <code>words</code>, return <em>the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below</em>.</p>
|
|
|
|
<p>In the <strong>American keyboard</strong>:</p>
|
|
|
|
<ul>
|
|
<li>the first row consists of the characters <code>"qwertyuiop"</code>,</li>
|
|
<li>the second row consists of the characters <code>"asdfghjkl"</code>, and</li>
|
|
<li>the third row consists of the characters <code>"zxcvbnm"</code>.</li>
|
|
</ul>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2018/10/12/keyboard.png" style="width: 800px; max-width: 600px; height: 267px;" />
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> words = ["Hello","Alaska","Dad","Peace"]
|
|
<strong>Output:</strong> ["Alaska","Dad"]
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> words = ["omk"]
|
|
<strong>Output:</strong> []
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> words = ["adsdf","sfd"]
|
|
<strong>Output:</strong> ["adsdf","sfd"]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= words.length <= 20</code></li>
|
|
<li><code>1 <= words[i].length <= 100</code></li>
|
|
<li><code>words[i]</code> consists of English letters (both lowercase and uppercase). </li>
|
|
</ul>
|