mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-03 06:22:54 +08:00
存量题库数据更新
This commit is contained in:
@@ -3,13 +3,13 @@
|
||||
<p>An <strong>Anagram</strong> is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<pre><strong>Input:</strong> strs = ["eat","tea","tan","ate","nat","bat"]
|
||||
<strong>Output:</strong> [["bat"],["nat","tan"],["ate","eat","tea"]]
|
||||
</pre><p><strong>Example 2:</strong></p>
|
||||
</pre><p><strong class="example">Example 2:</strong></p>
|
||||
<pre><strong>Input:</strong> strs = [""]
|
||||
<strong>Output:</strong> [[""]]
|
||||
</pre><p><strong>Example 3:</strong></p>
|
||||
</pre><p><strong class="example">Example 3:</strong></p>
|
||||
<pre><strong>Input:</strong> strs = ["a"]
|
||||
<strong>Output:</strong> [["a"]]
|
||||
</pre>
|
||||
|
Reference in New Issue
Block a user