2116. Check if a Parentheses String Can Be Valid
Description
A parentheses string is a non-empty string consisting only of '('
and ')'
. It is valid if any of the following conditions is true:
- It is
()
. - It can be written as
AB
(A
concatenated withB
), whereA
andB
are valid parentheses strings. - It can be written as
(A)
, whereA
is a valid parentheses string.
You are given a parentheses string s
and a string locked
, both of length n
. locked
is a binary string consisting only of '0'
s and '1'
s. For each index i
of locked
,
- If
locked[i]
is'1'
, you cannot changes[i]
. - But if
locked[i]
is'0'
, you can changes[i]
to either'('
or')'
.
Return true
if you can make s
a valid parentheses string. Otherwise, return false
.
Example 1:
Input: s = "))()))", locked = "010100" Output: true Explanation: locked[1] == '1' and locked[3] == '1', so we cannot change s[1] or s[3]. We change s[0] and s[4] to '(' while leaving s[2] and s[5] unchanged to make s valid.
Example 2:
Input: s = "()()", locked = "0000" Output: true Explanation: We do not need to make any changes because s is already valid.
Example 3:
Input: s = ")", locked = "0" Output: false Explanation: locked permits us to change s[0]. Changing s[0] to either '(' or ')' will not make s valid.
Constraints:
n == s.length == locked.length
1 <= n <= 105
s[i]
is either'('
or')'
.locked[i]
is either'0'
or'1'
.
Solution
check-if-a-parentheses-string-can-be-valid.py
class Solution:
def canBeValid(self, s: str, locked: str) -> bool:
n = len(s)
s = list(s)
if n & 1: return False
for i in range(n):
if locked[i] == '0':
s[i] = '#'
opened = closed = 0
for x in s:
if x == '#' or x == '(':
opened += 1
else:
closed += 1
if closed > opened:
return False
opened = closed = 0
for i in range(n - 1, -1, -1):
if s[i] == '#' or s[i] == ')':
closed += 1
else:
opened += 1
if opened > closed:
return False
return True