smallest-string-with-swaps

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 a string <code>s</code>, and an array of pairs of indices in the string&nbsp;<code>pairs</code>&nbsp;where&nbsp;<code>pairs[i] =&nbsp;[a, b]</code>&nbsp;indicates 2 indices(0-indexed) of the string.

You can&nbsp;swap the characters at any pair of indices in the given&nbsp;<code>pairs</code>&nbsp;any number of times.

Return the&nbsp;lexicographically smallest string that <code>s</code>&nbsp;can be changed to after using the swaps.

&nbsp;
Example 1:

<pre>
Input: s = &quot;dcab&quot;, pairs = [[0,3],[1,2]]
Output: &quot;bacd&quot;
Explaination: 
Swap s[0] and s[3], s = &quot;bcad&quot;
Swap s[1] and s[2], s = &quot;bacd&quot;
</pre>

Example 2:

<pre>
Input: s = &quot;dcab&quot;, pairs = [[0,3],[1,2],[0,2]]
Output: &quot;abcd&quot;
Explaination: 
Swap s[0] and s[3], s = &quot;bcad&quot;
Swap s[0] and s[2], s = &quot;acbd&quot;
Swap s[1] and s[2], s = &quot;abcd&quot;</pre>

Example 3:

<pre>
Input: s = &quot;cba&quot;, pairs = [[0,1],[1,2]]
Output: &quot;abc&quot;
Explaination: 
Swap s[0] and s[1], s = &quot;bca&quot;
Swap s[1] and s[2], s = &quot;bac&quot;
Swap s[0] and s[1], s = &quot;abc&quot;
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 10^5</code></li>
	<li><code>0 &lt;= pairs.length &lt;= 10^5</code></li>
	<li><code>0 &lt;= pairs[i][0], pairs[i][1] &lt;&nbsp;s.length</code></li>
	<li><code>s</code>&nbsp;only contains lower case English letters.</li>
</ul>

smallestStringWithSwaps

Smallest String With Swaps

Minimize Hamming Distance After Swap Operations

minimize-hamming-distance-after-swap-operations

执行交换操作后的最小汉明距离

Process Restricted Friend Requests

process-restricted-friend-requests

处理含限制条件的好友请求

Largest Number After Digit Swaps by Parity

largest-number-after-digit-swaps-by-parity

按奇偶性交换后的最大数字

Lexicographically Smallest Beautiful String

lexicographically-smallest-beautiful-string

字典序最小的美丽字符串

Make Lexicographically Smallest Array by Swapping Elements

make-lexicographically-smallest-array-by-swapping-elements

交换得到字典序最小的数组

Depth-First Search

Breadth-First Search

Union Find

Array

Hash Table

String

Sorting

给你一个字符串&nbsp;<code>s</code>，以及该字符串中的一些「索引对」数组&nbsp;<code>pairs</code>，其中&nbsp;<code>pairs[i] =&nbsp;[a, b]</code>&nbsp;表示字符串中的两个索引（编号从 0 开始）。

你可以 任意多次交换 在&nbsp;<code>pairs</code>&nbsp;中任意一对索引处的字符。

返回在经过若干次交换后，<code>s</code>&nbsp;可以变成的按字典序最小的字符串。

&nbsp;

示例 1:

<pre>输入：s = &quot;dcab&quot;, pairs = [[0,3],[1,2]]
输出：&quot;bacd&quot;
解释： 
交换 s[0] 和 s[3], s = &quot;bcad&quot;
交换 s[1] 和 s[2], s = &quot;bacd&quot;
</pre>

示例 2：

<pre>输入：s = &quot;dcab&quot;, pairs = [[0,3],[1,2],[0,2]]
输出：&quot;abcd&quot;
解释：
交换 s[0] 和 s[3], s = &quot;bcad&quot;
交换 s[0] 和 s[2], s = &quot;acbd&quot;
交换 s[1] 和 s[2], s = &quot;abcd&quot;</pre>

示例 3：

<pre>输入：s = &quot;cba&quot;, pairs = [[0,1],[1,2]]
输出：&quot;abc&quot;
解释：
交换 s[0] 和 s[1], s = &quot;bca&quot;
交换 s[1] 和 s[2], s = &quot;bac&quot;
交换 s[0] 和 s[1], s = &quot;abc&quot;
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 10^5</code></li>
	<li><code>0 &lt;= pairs.length &lt;= 10^5</code></li>
	<li><code>0 &lt;= pairs[i][0], pairs[i][1] &lt;&nbsp;s.length</code></li>
	<li><code>s</code>&nbsp;中只含有小写英文字母</li>
</ul>