mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-18 19:46:47 +08:00
更新国内版力扣题目描述变更
This commit is contained in:
@@ -1,12 +1,12 @@
|
||||
<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>
|
||||
<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>
|
||||
|
||||
|
||||
|
||||
|
Reference in New Issue
Block a user