Class Solution
-
- All Implemented Interfaces:
public final class Solution3223 - Minimum Length of String After Operations.
Medium
You are given a string
s.You can perform the following process on
sany number of times:Choose an index
iin the string such that there is at least one character to the left of indexithat is equal tos[i], and at least one character to the right that is also equal tos[i].Delete the closest character to the left of index
ithat is equal tos[i].Delete the closest character to the right of index
ithat is equal tos[i].
Return the minimum length of the final string
sthat you can achieve.Example 1:
Input: s = "abaacbcbb"
Output: 5
Explanation: We do the following operations:
Choose index 2, then remove the characters at indices 0 and 3. The resulting string is
s = "bacbcbb".Choose index 3, then remove the characters at indices 0 and 5. The resulting string is
s = "acbcb".
Example 2:
Input: s = "aa"
Output: 2
Explanation: We cannot perform any operations, so we return the length of the original string.
Constraints:
<code>1 <= s.length <= 2 * 10<sup>5</sup></code>
sconsists only of lowercase English letters.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final IntegerminimumLength(String s)-
-
Method Detail
-
minimumLength
final Integer minimumLength(String s)
-
-
-
-