keyboard-row

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of strings <code>words</code>, return the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below.

Note that the strings are case-insensitive, both lowercased and uppercased of the same letter are treated as if they are at the same row.

In the American keyboard:

<ul>
	<li>the first row consists of the characters <code>&quot;qwertyuiop&quot;</code>,</li>
	<li>the second row consists of the characters <code>&quot;asdfghjkl&quot;</code>, and</li>
	<li>the third row consists of the characters <code>&quot;zxcvbnm&quot;</code>.</li>
</ul>
<img alt="" src="https://assets.leetcode.com/uploads/2018/10/12/keyboard.png" style="width: 800px; max-width: 600px; height: 267px;" />
&nbsp;
Example 1:

<div class="example-block">
Input: words = [&quot;Hello&quot;,&quot;Alaska&quot;,&quot;Dad&quot;,&quot;Peace&quot;]

Output: [&quot;Alaska&quot;,&quot;Dad&quot;]

Explanation:

Both <code>&quot;a&quot;</code> and <code>&quot;A&quot;</code> are in the 2nd row of the American keyboard due to case insensitivity.
</div>

Example 2:

<div class="example-block">
Input: words = [&quot;omk&quot;]

Output: []
</div>

Example 3:

<div class="example-block">
Input: words = [&quot;adsdf&quot;,&quot;sfd&quot;]

Output: [&quot;adsdf&quot;,&quot;sfd&quot;]
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words.length &lt;= 20</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> consists of English letters (both lowercase and uppercase).&nbsp;</li>
</ul>

findWords

Keyboard Row

Find the Sequence of Strings Appeared on the Screen

find-the-sequence-of-strings-appeared-on-the-screen

出现在屏幕上的字符串序列

Find the Original Typed String I

find-the-original-typed-string-i

找到初始输入字符串 I

Find the Original Typed String II

find-the-original-typed-string-ii

找到初始输入字符串 II

Array

Hash Table

String

给你一个字符串数组 <code>words</code> ，只返回可以使用在 美式键盘 同一行的字母打印出来的单词。键盘如下图所示。

请注意，字符串&nbsp;不区分大小写，相同字母的大小写形式都被视为在同一行。

美式键盘 中：

<ul>
	<li>第一行由字符 <code>"qwertyuiop"</code> 组成。</li>
	<li>第二行由字符 <code>"asdfghjkl"</code> 组成。</li>
	<li>第三行由字符 <code>"zxcvbnm"</code> 组成。</li>
</ul>

<img alt="American keyboard" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/keyboard.png" style="width: 100%; max-width: 600px" />

&nbsp;

示例 1：

<div class="example-block">
输入：words = ["Hello","Alaska","Dad","Peace"]

输出：["Alaska","Dad"]

解释：

由于不区分大小写，<code>"a"</code> 和&nbsp;<code>"A"</code> 都在美式键盘的第二行。
</div>

示例 2：

<div class="example-block">
输入：words = ["omk"]

输出：[]
</div>

示例 3：

<div class="example-block">
输入：words = ["adsdf","sfd"]

输出：["adsdf","sfd"]
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= words.length &lt;= 20</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> 由英文字母（小写和大写字母）组成</li>
</ul>