Class Solution
java.lang.Object
g2301_2400.s2390_removing_stars_from_a_string.Solution
2390 - Removing Stars From a String.<p>Medium</p>
<p>You are given a string <code>s</code>, which contains stars <code>*</code>.</p>
<p>In one operation, you can:</p>
<ul>
<li>Choose a star in <code>s</code>.</li>
<li>Remove the closest <strong>non-star</strong> character to its <strong>left</strong> , as well as remove the star itself.</li>
</ul>
<p>Return <em>the string after <strong>all</strong> stars have been removed</em>.</p>
<p><strong>Note:</strong></p>
<ul>
<li>The input will be generated such that the operation is always possible.</li>
<li>It can be shown that the resulting string will always be unique.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “leet**cod*e”</p>
<p><strong>Output:</strong> “lecoe”</p>
<p><strong>Explanation:</strong> Performing the removals from left to right:</p>
<ul>
<li>
<p>The closest character to the 1<sup>st</sup> star is ‘t’ in “lee**<ins>t</ins>****cod*e”. s becomes “lee*cod*e”.</p>
</li>
<li>
<p>The closest character to the 2<sup>nd</sup> star is ‘e’ in “le**<ins>e</ins>***cod*e”. s becomes “lecod*e”.</p>
</li>
<li>
<p>The closest character to the 3<sup>rd</sup> star is ‘d’ in “leco**<ins>d</ins>***e”. s becomes “lecoe”.</p>
</li>
</ul>
<p>There are no more stars, so we return “lecoe”.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “erase*****”</p>
<p><strong>Output:</strong> ""</p>
<p><strong>Explanation:</strong> The entire string is removed, so we return an empty string.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
<li><code>s</code> consists of lowercase English letters and stars <code>*</code>.</li>
<li>The operation above can be performed on <code>s</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
removeStars
-