mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
13 lines
522 B
HTML
13 lines
522 B
HTML
<p>Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.</p>
|
||
|
||
|
||
|
||
<p> </p>
|
||
|
||
|
||
|
||
<p><strong>Example1: </strong></p>
|
||
|
||
|
||
|
||
<pre>
|
||
|
||
<strong>Input: "</strong>tactcoa"
|
||
|
||
<strong>Output: </strong>true(permutations: "tacocat"、"atcocta", etc.)
|
||
|
||
</pre>
|
||
|
||
|
||
|
||
<p> </p>
|
||
|