mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
39 lines
1.8 KiB
HTML
39 lines
1.8 KiB
HTML
<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> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> a = 1, b = 1, c = 7
|
|
<strong>Output:</strong> "ccaccbcc"
|
|
<strong>Explanation:</strong> "ccbccacc" would also be a correct answer.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> a = 7, b = 1, c = 0
|
|
<strong>Output:</strong> "aabaa"
|
|
<strong>Explanation:</strong> It is the only correct answer in this case.
|
|
</pre>
|
|
|
|
<p> </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>
|