mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-12-19 02:24:59 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定一个字符串数组 <code>strs</code> ,将 <strong>变位词 </strong>组合在一起。 可以按任意顺序返回结果列表。</p>\n\n<p><strong>注意:</strong>若两个字符串中每个字符出现的次数都相同,则称它们互为变位词。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong> strs = <code>["eat", "tea", "tan", "ate", "nat", "bat"]</code>\n<strong>输出: </strong>[["bat"],["nat","tan"],["ate","eat","tea"]]</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> strs = <code>[""]</code>\n<strong>输出: </strong>[[""]]\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong> strs = <code>["a"]</code>\n<strong>输出: </strong>[["a"]]</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= strs.length <= 10<sup>4</sup></code></li>\n\t<li><code>0 <= strs[i].length <= 100</code></li>\n\t<li><code>strs[i]</code> 仅包含小写字母</li>\n</ul>\n\n<p> </p>\n\n<p><meta charset=\"UTF-8\" />注意:本题与主站 49 题相同: <a href=\"https://leetcode-cn.com/problems/group-anagrams/\">https://leetcode-cn.com/problems/group-anagrams/</a></p>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 21,
|
||||
"likes": 24,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -156,7 +156,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"14.2K\", \"totalAcceptedRaw\": 10725, \"totalSubmissionRaw\": 14168, \"acRate\": \"75.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 12621, \"totalSubmissionRaw\": 16814, \"acRate\": \"75.1%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
||||
Reference in New Issue
Block a user