Package g1601_1700.s1653_minimum_deletions_to_make_string_balanced

Class Solution

java.lang.Object

g1601_1700.s1653_minimum_deletions_to_make_string_balanced.Solution

public class Solution
extends Object

1653 - Minimum Deletions to Make String Balanced.<p>Medium</p> <p>You are given a string <code>s</code> consisting only of characters <code>'a'</code> and <code>'b'</code>.</p> <p>You can delete any number of characters in <code>s</code> to make <code>s</code> <strong>balanced</strong>. <code>s</code> is <strong>balanced</strong> if there is no pair of indices <code>(i,j)</code> such that <code>i < j</code> and <code>s[i] = 'b'</code> and <code>s[j]= 'a'</code>.</p> <p>Return <em>the <strong>minimum</strong> number of deletions needed to make</em> <code>s</code> <em><strong>balanced</strong></em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;aababbab&rdquo;</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> You can either:</p> <p>Delete the characters at 0-indexed positions 2 and 6 (&ldquo;aababbab&rdquo; -> &ldquo;aaabbb&rdquo;), or</p> <p>Delete the characters at 0-indexed positions 3 and 6 (&ldquo;aababbab&rdquo; -> &ldquo;aabbbb&rdquo;).</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;bbaaaaabb&rdquo;</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> The only solution is to delete the first two characters.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 10⁵</code></li> <li><code>s[i]</code> is <code>'a'</code> or <code>'b'</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minimumDeletions(String s)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minimumDeletions

public int minimumDeletions(String s)