mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
34 lines
1.5 KiB
HTML
34 lines
1.5 KiB
HTML
<p>You are given an array of strings <code>words</code> (<strong>0-indexed</strong>).</p>
|
|
|
|
<p>In one operation, pick two <strong>distinct</strong> indices <code>i</code> and <code>j</code>, where <code>words[i]</code> is a non-empty string, and move <strong>any</strong> character from <code>words[i]</code> to <strong>any</strong> position in <code>words[j]</code>.</p>
|
|
|
|
<p>Return <code>true</code> <em>if you can make<strong> every</strong> string in </em><code>words</code><em> <strong>equal </strong>using <strong>any</strong> number of operations</em>,<em> and </em><code>false</code> <em>otherwise</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> words = ["abc","aabc","bc"]
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong> Move the first 'a' in <code>words[1] to the front of words[2],
|
|
to make </code><code>words[1]</code> = "abc" and words[2] = "abc".
|
|
All the strings are now equal to "abc", so return <code>true</code>.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> words = ["ab","a"]
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> It is impossible to make all the strings equal using the operation.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= words.length <= 100</code></li>
|
|
<li><code>1 <= words[i].length <= 100</code></li>
|
|
<li><code>words[i]</code> consists of lowercase English letters.</li>
|
|
</ul>
|