longest-happy-string

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

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>