Class Solution
java.lang.Object
g1401_1500.s1405_longest_happy_string.Solution
1405 - Longest Happy String.<p>Medium</p>
<p>A string <code>s</code> is called <strong>happy</strong> if it satisfies the following conditions:</p>
<ul>
<li><code>s</code> only contains the letters <code>'a'</code>, <code>'b'</code>, and <code>'c'</code>.</li>
<li><code>s</code> does not contain any of <code>"aaa"</code>, <code>"bbb"</code>, or <code>"ccc"</code> as a substring.</li>
<li><code>s</code> contains <strong>at most</strong> <code>a</code> occurrences of the letter <code>'a'</code>.</li>
<li><code>s</code> contains <strong>at most</strong> <code>b</code> occurrences of the letter <code>'b'</code>.</li>
<li><code>s</code> contains <strong>at most</strong> <code>c</code> occurrences of the letter <code>'c'</code>.</li>
</ul>
<p>Given three integers <code>a</code>, <code>b</code>, and <code>c</code>, return <em>the <strong>longest possible happy</strong> string</em>. If there are multiple longest happy strings, return <em>any of them</em>. If there is no such string, return <em>the empty string</em> <code>""</code>.</p>
<p>A <strong>substring</strong> is a contiguous sequence of characters within a string.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> a = 1, b = 1, c = 7</p>
<p><strong>Output:</strong> “ccaccbcc”</p>
<p><strong>Explanation:</strong> “ccbccacc” would also be a correct answer.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> a = 7, b = 1, c = 0</p>
<p><strong>Output:</strong> “aabaa”</p>
<p><strong>Explanation:</strong> It is the only correct answer in this case.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>0 <= a, b, c <= 100</code></li>
<li><code>a + b + c > 0</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
longestDiverseString
-