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

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two strings <code>s1</code> and <code>s2</code> of equal length. A string swap is an operation where you choose two indices in a string (not necessarily different) and swap the characters at these indices.

Return <code>true</code> if it is possible to make both strings equal by performing at most one string swap on exactly one of the strings. Otherwise, return <code>false</code>.

&nbsp;
Example 1:

<pre>
Input: s1 = &quot;bank&quot;, s2 = &quot;kanb&quot;
Output: true
Explanation: For example, swap the first character with the last character of s2 to make &quot;bank&quot;.
</pre>

Example 2:

<pre>
Input: s1 = &quot;attack&quot;, s2 = &quot;defend&quot;
Output: false
Explanation: It is impossible to make them equal with one string swap.
</pre>

Example 3:

<pre>
Input: s1 = &quot;kelb&quot;, s2 = &quot;kelb&quot;
Output: true
Explanation: The two strings are already equal, so no string swap operation is required.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 100</code></li>
	<li><code>s1.length == s2.length</code></li>
	<li><code>s1</code> and <code>s2</code> consist of only lowercase English letters.</li>
</ul>

areAlmostEqual

Check if One String Swap Can Make Strings Equal

Buddy Strings

buddy-strings

亲密字符串

Make Number of Distinct Characters Equal

make-number-of-distinct-characters-equal

使字符串中不同字符的数目相等

Count Almost Equal Pairs I

count-almost-equal-pairs-i

统计近似相等数对 I

Hash Table

String

Counting

给你长度相等的两个字符串 <code>s1</code> 和 <code>s2</code> 。一次 字符串交换 操作的步骤如下：选出某个字符串中的两个下标（不必不同），并交换这两个下标所对应的字符。

如果对 其中一个字符串 执行 最多一次字符串交换 就可以使两个字符串相等，返回 <code>true</code> ；否则，返回 <code>false</code> 。

 

示例 1：

<pre>输入：s1 = "bank", s2 = "kanb"
输出：true
解释：例如，交换 s2 中的第一个和最后一个字符可以得到 "bank"
</pre>

示例 2：

<pre>输入：s1 = "attack", s2 = "defend"
输出：false
解释：一次字符串交换无法使两个字符串相等
</pre>

示例 3：

<pre>输入：s1 = "kelb", s2 = "kelb"
输出：true
解释：两个字符串已经相等，所以不需要进行字符串交换
</pre>

示例 4：

<pre>输入：s1 = "abcd", s2 = "dcba"
输出：false
</pre>

 

提示：

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 100</code></li>
	<li><code>s1.length == s2.length</code></li>
	<li><code>s1</code> 和 <code>s2</code> 仅由小写英文字母组成</li>
</ul>