mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
44 lines
1.7 KiB
HTML
44 lines
1.7 KiB
HTML
<p>A <strong>fancy string</strong> is a string where no <strong>three</strong> <strong>consecutive</strong> characters are equal.</p>
|
|
|
|
<p>Given a string <code>s</code>, delete the <strong>minimum</strong> possible number of characters from <code>s</code> to make it <strong>fancy</strong>.</p>
|
|
|
|
<p>Return <em>the final string after the deletion</em>. It can be shown that the answer will always be <strong>unique</strong>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "le<u>e</u>etcode"
|
|
<strong>Output:</strong> "leetcode"
|
|
<strong>Explanation:</strong>
|
|
Remove an 'e' from the first group of 'e's to create "leetcode".
|
|
No three consecutive characters are equal, so return "leetcode".
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "<u>a</u>aab<u>aa</u>aa"
|
|
<strong>Output:</strong> "aabaa"
|
|
<strong>Explanation:</strong>
|
|
Remove an 'a' from the first group of 'a's to create "aabaaaa".
|
|
Remove two 'a's from the second group of 'a's to create "aabaa".
|
|
No three consecutive characters are equal, so return "aabaa".
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "aab"
|
|
<strong>Output:</strong> "aab"
|
|
<strong>Explanation:</strong> No three consecutive characters are equal, so return "aab".
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
|
<li><code>s</code> consists only of lowercase English letters.</li>
|
|
</ul>
|