make-number-of-distinct-characters-equal

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Create a frequency array of the letters of each string.

There are 26*26 possible pairs of letters to swap. Can we try them all?

Iterate over all possible pairs of letters and check if swapping them will yield two strings that have the same number of distinct characters. Use the frequency array for the check.

Algorithms

You are given two 0-indexed strings <code>word1</code> and <code>word2</code>.

A move consists of choosing two indices <code>i</code> and <code>j</code> such that <code>0 &lt;= i &lt; word1.length</code> and <code>0 &lt;= j &lt; word2.length</code> and swapping <code>word1[i]</code> with <code>word2[j]</code>.

Return <code>true</code> if it is possible to get the number of distinct characters in <code>word1</code> and <code>word2</code> to be equal with exactly one move. Return <code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: word1 = &quot;ac&quot;, word2 = &quot;b&quot;
Output: false
Explanation: Any pair of swaps would yield two distinct characters in the first string, and one in the second string.
</pre>

Example 2:

<pre>
Input: word1 = &quot;abcc&quot;, word2 = &quot;aab&quot;
Output: true
Explanation: We swap index 2 of the first string with index 0 of the second string. The resulting strings are word1 = &quot;abac&quot; and word2 = &quot;cab&quot;, which both have 3 distinct characters.
</pre>

Example 3:

<pre>
Input: word1 = &quot;abcde&quot;, word2 = &quot;fghij&quot;
Output: true
Explanation: Both resulting strings will have 5 distinct characters, regardless of which indices we swap.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word1.length, word2.length &lt;= 105</code></li>
	<li><code>word1</code> and <code>word2</code> consist of only lowercase English letters.</li>
</ul>

第 327 场周赛

weekly-contest-327

isItPossible

高级工程师

Make Number of Distinct Characters Equal

Bulls and Cows

bulls-and-cows

猜数字游戏

Buddy Strings

buddy-strings

亲密字符串

Minimum Swaps to Make Strings Equal

minimum-swaps-to-make-strings-equal

交换字符使得字符串相同

Check if One String Swap Can Make Strings Equal

check-if-one-string-swap-can-make-strings-equal

仅执行一次字符串交换能否使两个字符串相等

Check if All Characters Have Equal Number of Occurrences

check-if-all-characters-have-equal-number-of-occurrences

检查是否所有字符出现次数相同

Hash Table

String

Counting

给你两个下标从 0 开始的字符串 <code>word1</code> 和 <code>word2</code> 。

一次 移动 由以下两个步骤组成：

<ul>
	<li>选中两个下标&nbsp;<code>i</code> 和 <code>j</code> ，分别满足 <code>0 &lt;= i &lt; word1.length</code> 和 <code>0 &lt;= j &lt; word2.length</code> ，</li>
	<li>交换 <code>word1[i]</code> 和 <code>word2[j]</code> 。</li>
</ul>

如果可以通过 恰好一次 移动，使 <code>word1</code> 和 <code>word2</code> 中不同字符的数目相等，则返回 <code>true</code> ；否则，返回 <code>false</code> 。

&nbsp;

示例 1：

<pre>输入：word1 = "ac", word2 = "b"
输出：false
解释：交换任何一组下标都会导致第一个字符串中有 2 个不同的字符，而在第二个字符串中只有 1 个不同字符。
</pre>

示例 2：

<pre>输入：word1 = "abcc", word2 = "aab"
输出：true
解释：交换第一个字符串的下标 2 和第二个字符串的下标 0 。之后得到 word1 = "abac" 和 word2 = "cab" ，各有 3 个不同字符。
</pre>

示例 3：

<pre>输入：word1 = "abcde", word2 = "fghij"
输出：true
解释：无论交换哪一组下标，两个字符串中都会有 5 个不同字符。</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= word1.length, word2.length &lt;= 105</code></li>
	<li><code>word1</code> 和 <code>word2</code> 仅由小写英文字母组成。</li>
</ul>