check-if-strings-can-be-made-equal-with-operations-ii

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two strings <code>s1</code> and <code>s2</code>, both of length <code>n</code>, consisting of lowercase English letters.

You can apply the following operation on any of the two strings any number of times:

<ul>
	<li>Choose any two indices <code>i</code> and <code>j</code> such that <code>i &lt; j</code> and the difference <code>j - i</code> is even, then swap the two characters at those indices in the string.</li>
</ul>

Return <code>true</code> if you can make the strings <code>s1</code> and <code>s2</code> equal, and&nbsp;<code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: s1 = &quot;abcdba&quot;, s2 = &quot;cabdab&quot;
Output: true
Explanation: We can apply the following operations on s1:
- Choose the indices i = 0, j = 2. The resulting string is s1 = &quot;cbadba&quot;.
- Choose the indices i = 2, j = 4. The resulting string is s1 = &quot;cbbdaa&quot;.
- Choose the indices i = 1, j = 5. The resulting string is s1 = &quot;cabdab&quot; = s2.
</pre>

Example 2:

<pre>
Input: s1 = &quot;abe&quot;, s2 = &quot;bea&quot;
Output: false
Explanation: It is not possible to make the two strings equal.
</pre>

&nbsp;
Constraints:

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

第 112 场双周赛

biweekly-contest-112

checkStrings

高级工程师

Check if Strings Can be Made Equal With Operations II

Hash Table

String

Sorting

给你两个字符串&nbsp;<code>s1</code>&nbsp;和&nbsp;<code>s2</code>&nbsp;，两个字符串长度都为&nbsp;<code>n</code>&nbsp;，且只包含&nbsp;小写&nbsp;英文字母。

你可以对两个字符串中的 任意一个&nbsp;执行以下操作 任意&nbsp;次：

<ul>
	<li>选择两个下标&nbsp;<code>i</code> 和&nbsp;<code>j</code>&nbsp;，满足 <code>i &lt; j</code>&nbsp;且 <code>j - i</code>&nbsp;是 偶数，然后 交换 这个字符串中两个下标对应的字符。</li>
</ul>

&nbsp;

如果你可以让字符串&nbsp;<code>s1</code> 和&nbsp;<code>s2</code>&nbsp;相等，那么返回 <code>true</code>&nbsp;，否则返回 <code>false</code>&nbsp;。

&nbsp;

&nbsp;

示例 1：

<pre>
输入：s1 = "abcdba", s2 = "cabdab"
输出：true
解释：我们可以对 s1 执行以下操作：
- 选择下标 i = 0 ，j = 2 ，得到字符串 s1 = "cbadba" 。
- 选择下标 i = 2 ，j = 4 ，得到字符串 s1 = "cbbdaa" 。
- 选择下标 i = 1 ，j = 5 ，得到字符串 s1 = "cabdab" = s2 。
</pre>

示例 2：

<pre>
输入：s1 = "abe", s2 = "bea"
输出：false
解释：无法让两个字符串相等。
</pre>

&nbsp;

提示：

<ul>
	<li><code>n == s1.length == s2.length</code></li>
	<li><code>1 &lt;= n &lt;= 105</code></li>
	<li><code>s1</code> 和&nbsp;<code>s2</code>&nbsp;只包含小写英文字母。</li>
</ul>