문제
1963. Minimum Number of Swaps to Make the String Balanced
Medium
403
19
Add to List
Share
You are given a 0-indexed string
s
of even length n
. The string consists of exactly n / 2
opening brackets '['
and n / 2
closing brackets ']'
.A string is called balanced if and only if:
- It is the empty string, or
- It can be written as
AB
, where bothA
andB
are balanced strings, or
- It can be written as
[C]
, whereC
is a balanced string.
You may swap the brackets at any two indices any number of times.
Return the minimum number of swaps to make
s
balanced.Example 1:
Example 2:
Example 3:
Constraints:
n == s.length
2 <= n <= 10
6
n
is even.
s[i]
is either'['
or']'
.
- The number of opening brackets
'['
equalsn / 2
, and the number of closing brackets']'
equalsn / 2
.