longest-happy-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

A string <code>s</code> is called happy if it satisfies the following conditions:

<ul>
	<li><code>s</code> only contains the letters <code>&#39;a&#39;</code>, <code>&#39;b&#39;</code>, and <code>&#39;c&#39;</code>.</li>
	<li><code>s</code> does not contain any of <code>&quot;aaa&quot;</code>, <code>&quot;bbb&quot;</code>, or <code>&quot;ccc&quot;</code> as a substring.</li>
	<li><code>s</code> contains at most <code>a</code> occurrences of the letter <code>&#39;a&#39;</code>.</li>
	<li><code>s</code> contains at most <code>b</code> occurrences of the letter <code>&#39;b&#39;</code>.</li>
	<li><code>s</code> contains at most <code>c</code> occurrences of the letter <code>&#39;c&#39;</code>.</li>
</ul>

Given three integers <code>a</code>, <code>b</code>, and <code>c</code>, return the longest possible happy string. If there are multiple longest happy strings, return any of them. If there is no such string, return the empty string <code>&quot;&quot;</code>.

A substring is a contiguous sequence of characters within a string.

&nbsp;
Example 1:

<pre>
Input: a = 1, b = 1, c = 7
Output: &quot;ccaccbcc&quot;
Explanation: &quot;ccbccacc&quot; would also be a correct answer.
</pre>

Example 2:

<pre>
Input: a = 7, b = 1, c = 0
Output: &quot;aabaa&quot;
Explanation: It is the only correct answer in this case.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= a, b, c &lt;= 100</code></li>
	<li><code>a + b + c &gt; 0</code></li>
</ul>

longestDiverseString

Longest Happy String

Reorganize String

reorganize-string

重构字符串

Greedy

String

Heap (Priority Queue)

如果字符串中不含有任何 <code>&#39;aaa&#39;</code>，<code>&#39;bbb&#39;</code> 或 <code>&#39;ccc&#39;</code> 这样的字符串作为子串，那么该字符串就是一个「快乐字符串」。

给你三个整数 <code>a</code>，<code>b</code> ，<code>c</code>，请你返回 任意一个 满足下列全部条件的字符串 <code>s</code>：

<ul>
	<li><code>s</code> 是一个尽可能长的快乐字符串。</li>
	<li><code>s</code> 中 最多 有<code>a</code> 个字母 <code>&#39;a&#39;</code>、<code>b</code>&nbsp;个字母 <code>&#39;b&#39;</code>、<code>c</code> 个字母 <code>&#39;c&#39;</code> 。</li>
	<li><code>s </code>中只含有 <code>&#39;a&#39;</code>、<code>&#39;b&#39;</code> 、<code>&#39;c&#39;</code> 三种字母。</li>
</ul>

如果不存在这样的字符串 <code>s</code> ，请返回一个空字符串 <code>&quot;&quot;</code>。

&nbsp;

示例 1：

<pre>输入：a = 1, b = 1, c = 7
输出：&quot;ccaccbcc&quot;
解释：&quot;ccbccacc&quot; 也是一种正确答案。
</pre>

示例 2：

<pre>输入：a = 2, b = 2, c = 1
输出：&quot;aabbc&quot;
</pre>

示例 3：

<pre>输入：a = 7, b = 1, c = 0
输出：&quot;aabaa&quot;
解释：这是该测试用例的唯一正确答案。</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= a, b, c &lt;= 100</code></li>
	<li><code>a + b + c &gt; 0</code></li>
</ul>