mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
24 lines
1.0 KiB
HTML
24 lines
1.0 KiB
HTML
<p>Given an array of strings <code>strs</code>, group <strong>the anagrams</strong> together. You can return the answer in <strong>any order</strong>.</p>
|
|
|
|
<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 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 class="example">Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> strs = [""]
|
|
<strong>Output:</strong> [[""]]
|
|
</pre><p><strong class="example">Example 3:</strong></p>
|
|
<pre><strong>Input:</strong> strs = ["a"]
|
|
<strong>Output:</strong> [["a"]]
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= strs.length <= 10<sup>4</sup></code></li>
|
|
<li><code>0 <= strs[i].length <= 100</code></li>
|
|
<li><code>strs[i]</code> consists of lowercase English letters.</li>
|
|
</ul>
|