reorganize-string

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>, rearrange the characters of <code>s</code> so that any two adjacent characters are not the same.

Return any possible rearrangement of <code>s</code> or return <code>&quot;&quot;</code> if not possible.

&nbsp;
Example 1:
<pre>Input: s = "aab"
Output: "aba"
</pre>Example 2:
<pre>Input: s = "aaab"
Output: ""
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 500</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

reorganizeString

Reorganize String

Rearrange String k Distance Apart

rearrange-string-k-distance-apart

K 距离间隔重排字符串

Task Scheduler

task-scheduler

任务调度器

Longest Happy String

longest-happy-string

最长快乐字符串

Greedy

Hash Table

String

Counting

Sorting

Heap (Priority Queue)

给定一个字符串&nbsp;<code>s</code>&nbsp;，检查是否能重新排布其中的字母，使得两相邻的字符不同。

返回 <code>s</code>&nbsp;的任意可能的重新排列。若不可行，返回空字符串&nbsp;<code>""</code>&nbsp;。

&nbsp;

示例&nbsp;1:

<pre>
输入: s = "aab"
输出: "aba"
</pre>

示例 2:

<pre>
输入: s = "aaab"
输出: ""
</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= s.length &lt;= 500</code></li>
	<li><code>s</code> 只包含小写字母</li>
</ul>