mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -18,7 +18,7 @@
|
||||
<p>Return <em>the number of <strong>groups of special-equivalent strings</strong> from </em><code>words</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> words = ["abcd","cdab","cbad","xyzz","zzxy","zzyx"]
|
||||
@@ -29,7 +29,7 @@ The other two groups are ["xyzz", "zzxy"] and ["zzyx&qu
|
||||
Note that in particular, "zzxy" is not special equivalent to "zzyx".
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> words = ["abc","acb","bac","bca","cab","cba"]
|
||||
|
Reference in New Issue
Block a user