mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 11:21:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
@@ -0,0 +1,15 @@
|
||||
<p>给定一个字符串,编写一个函数判定其是否为某个回文串的排列之一。</p>
|
||||
|
||||
<p>回文串是指正反两个方向都一样的单词或短语。排列是指字母的重新排列。</p>
|
||||
|
||||
<p>回文串不一定是字典当中的单词。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例1:</strong></p>
|
||||
|
||||
<pre><strong>输入:"</strong>tactcoa"
|
||||
<strong>输出:</strong>true(排列有"tacocat"、"atcocta",等等)
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
Reference in New Issue
Block a user