coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-18 02:02:34 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
leetcode-cn/problem (Chinese)/T9键盘 [t9-lcci].html
View File

@@ -1,19 +1,21 @@
<p>在老式手机上，用户通过数字键盘输入，手机将提供与这些数字相匹配的单词列表。每个数字映射到0至4个字母。给定一个数字序列，实现一个算法来返回匹配单词的列表。你会得到一张含有有效单词的列表。映射如下图所示：</p>
<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/original_images/17_telephone_keypad.png" style="width: 200px;"></p>
<p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/original_images/17_telephone_keypad.png" style="width: 200px;" /></p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入:</strong> num = &quot;8733&quot;, words = [&quot;tree&quot;, &quot;used&quot;]
<strong>输出:</strong> [&quot;tree&quot;, &quot;used&quot;]
<pre>
<strong>输入：</strong>num = "8733", words = ["tree", "used"]
<strong>输出：</strong>["tree", "used"]
</pre>
<p><strong>示例 2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre><strong>输入:</strong> num = &quot;2&quot;, words = [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;]
<strong>输出:</strong> [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;]</pre>
<pre>
<strong>输入：</strong>num = "2", words = ["a", "b", "c", "d"]
<strong>输出：</strong>["a", "b", "c"]</pre>
<p>提示：</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>num.length &lt;= 1000</code></li>