mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
54 lines
2.7 KiB
HTML
54 lines
2.7 KiB
HTML
|
<p>You are given a <strong>0-indexed</strong> string array <code>words</code> having length <code>n</code> and containing <strong>0-indexed</strong> strings.</p>
|
||
|
|
|
||
|
|
<p>You are allowed to perform the following operation <strong>any</strong> number of times (<strong>including</strong> <strong>zero</strong>):</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>Choose integers <code>i</code>, <code>j</code>, <code>x</code>, and <code>y</code> such that <code>0 <= i, j < n</code>, <code>0 <= x < words[i].length</code>, <code>0 <= y < words[j].length</code>, and <strong>swap</strong> the characters <code>words[i][x]</code> and <code>words[j][y]</code>.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>Return <em>an integer denoting the <strong>maximum</strong> number of <span data-keyword="palindrome-string">palindromes</span> </em><code>words</code><em> can contain, after performing some operations.</em></p>
|
||
|
|
|
||
|
|
<p><strong>Note:</strong> <code>i</code> and <code>j</code> may be equal during an operation.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["abbb","ba","aa"]
|
||
|
|
<strong>Output:</strong> 3
|
||
|
|
<strong>Explanation:</strong> In this example, one way to get the maximum number of palindromes is:
|
||
|
|
Choose i = 0, j = 1, x = 0, y = 0, so we swap words[0][0] and words[1][0]. words becomes ["bbbb","aa","aa"].
|
||
|
|
All strings in words are now palindromes.
|
||
|
|
Hence, the maximum number of palindromes achievable is 3.</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["abc","ab"]
|
||
|
|
<strong>Output:</strong> 2
|
||
|
|
<strong>Explanation: </strong>In this example, one way to get the maximum number of palindromes is:
|
||
|
|
Choose i = 0, j = 1, x = 1, y = 0, so we swap words[0][1] and words[1][0]. words becomes ["aac","bb"].
|
||
|
|
Choose i = 0, j = 0, x = 1, y = 2, so we swap words[0][1] and words[0][2]. words becomes ["aca","bb"].
|
||
|
|
Both strings are now palindromes.
|
||
|
|
Hence, the maximum number of palindromes achievable is 2.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> words = ["cd","ef","a"]
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
<strong>Explanation:</strong> In this example, there is no need to perform any operation.
|
||
|
|
There is one palindrome in words "a".
|
||
|
|
It can be shown that it is not possible to get more than one palindrome after any number of operations.
|
||
|
|
Hence, the answer is 1.</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= words.length <= 1000</code></li>
|
||
|
|
<li><code>1 <= words[i].length <= 100</code></li>
|
||
|
|
<li><code>words[i]</code> consists only of lowercase English letters.</li>
|
||
|
|
</ul>
|