Class Solution
java.lang.Object
g1901_2000.s1957_delete_characters_to_make_fancy_string.Solution
1957 - Delete Characters to Make Fancy String.<p>Easy</p>
<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><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “leeetcode”</p>
<p><strong>Output:</strong> “leetcode”</p>
<p><strong>Explanation:</strong></p>
<p>Remove an ‘e’ from the first group of ’e’s to create “leetcode”.</p>
<p>No three consecutive characters are equal, so return “leetcode”.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “aaabaaaa”</p>
<p><strong>Output:</strong> “aabaa”</p>
<p><strong>Explanation:</strong></p>
<p>Remove an ‘a’ from the first group of ’a’s to create “aabaaaa”.</p>
<p>Remove two ’a’s from the second group of ’a’s to create “aabaa”.</p>
<p>No three consecutive characters are equal, so return “aabaa”.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> s = “aab”</p>
<p><strong>Output:</strong> “aab”</p>
<p><strong>Explanation:</strong> No three consecutive characters are equal, so return “aab”.</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>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
makeFancyString
-