-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
ddb8c91
commit 084bc43
Showing
1 changed file
with
38 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,38 @@ | ||
| <h2><a href="https://leetcode.com/problems/longest-happy-string">1405. Longest Happy String</a></h2><h3>Medium</h3><hr><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> |