update

leetcode-cn/originData/t9-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>在老式手机上，用户通过数字键盘输入，手机将提供与这些数字相匹配的单词列表。每个数字映射到0至4个字母。给定一个数字序列，实现一个算法来返回匹配单词的列表。你会得到一张含有有效单词的列表。映射如下图所示：</p>\n\n<p><img src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/original_images/17_telephone_keypad.png\" style=\"width: 200px;\"></p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong> num = &quot;8733&quot;, words = [&quot;tree&quot;, &quot;used&quot;]\n<strong>输出:</strong> [&quot;tree&quot;, &quot;used&quot;]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre><strong>输入:</strong> num = &quot;2&quot;, words = [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;]\n<strong>输出:</strong> [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;]</pre>\n\n<p>提示：</p>\n\n<ul>\n\t<li><code>num.length &lt;= 1000</code></li>\n\t<li><code>words.length &lt;= 500</code></li>\n\t<li><code>words[i].length == num.length</code></li>\n\t<li><code>num</code>中不会出现 0, 1 这两个数字</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 29,
+            "likes": 30,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"14.8K\", \"totalAcceptedRaw\": 10668, \"totalSubmissionRaw\": 14832, \"acRate\": \"71.9%\"}",
+            "stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 11018, \"totalSubmissionRaw\": 15337, \"acRate\": \"71.8%\"}",
             "hints": [
                 "想想递归。",
                 "你能递归地尝试所有的可能性吗？",