lexicographically-smallest-string-after-a-swap

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code> containing only digits, return the lexicographically smallest string that can be obtained after swapping adjacent digits in <code>s</code> with the same parity at most once.

Digits have the same parity if both are odd or both are even. For example, 5 and 9, as well as 2 and 4, have the same parity, while 6 and 9 do not.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;45320&quot;

Output: &quot;43520&quot;

Explanation: 

<code>s[1] == &#39;5&#39;</code> and <code>s[2] == &#39;3&#39;</code> both have the same parity, and swapping them results in the lexicographically smallest string.
</div>

Example 2:

<div class="example-block">
Input: s = &quot;001&quot;

Output: &quot;001&quot;

Explanation:

There is no need to perform a swap because <code>s</code> is already the lexicographically smallest.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= s.length &lt;= 100</code></li>
	<li><code>s</code> consists only of digits.</li>
</ul>

getSmallestString

Lexicographically Smallest String After a Swap

Lexicographically Smallest String After Applying Operations

lexicographically-smallest-string-after-applying-operations

执行操作后字典序最小的字符串

Greedy

String

给你一个仅由数字组成的字符串 <code>s</code>，在最多交换一次 相邻 且具有相同 奇偶性 的数字后，返回可以得到的字典序最小的字符串。

如果两个数字都是奇数或都是偶数，则它们具有相同的奇偶性。例如，5 和 9、2 和 4 奇偶性相同，而 6 和 9 奇偶性不同。

&nbsp;

示例 1：

<div class="example-block">
输入： s = "45320"

输出： "43520"

解释：

<code>s[1] == '5'</code> 和 <code>s[2] == '3'</code> 都具有相同的奇偶性，交换它们可以得到字典序最小的字符串。
</div>

示例 2：

<div class="example-block">
输入： s = "001"

输出： "001"

解释：

无需进行交换，因为 <code>s</code> 已经是字典序最小的。
</div>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= s.length &lt;= 100</code></li>
	<li><code>s</code> 仅由数字组成。</li>
</ul>