-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy path1249.Minimum_Remove_to_Make_Valid_Parentheses.py
More file actions
78 lines (60 loc) Β· 2.09 KB
/
1249.Minimum_Remove_to_Make_Valid_Parentheses.py
File metadata and controls
78 lines (60 loc) Β· 2.09 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
"""
Given a string s of '(' , ')' and lowercase English characters.
Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string.
Formally, a parentheses string is valid if and only if:
It is the empty string, contains only lowercase characters, or
It can be written as AB (A concatenated with B), where A and B are valid strings, or
It can be written as (A), where A is a valid string.
Example 1:
Input: s = "lee(t(c)o)de)"
Output: "lee(t(c)o)de"
Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
Example 2:
Input: s = "a)b(c)d"
Output: "ab(c)d"
Example 3:
Input: s = "))(("
Output: ""
Explanation: An empty string is also valid.
Constraints:
1 <= s.length <= 105
s[i] is either'(' , ')', or lowercase English letter.
"""
//https://leetcode-cn.com/problems/minimum-remove-to-make-valid-parentheses/solution/yi-chu-wu-xiao-gua-hao-by-leetcode/
class Solution:
def minRemoveToMakeValid(self, s: str) -> str:
st = []
for i, ch in enumerate(s):
if ch not in "()":
continue
if len(st) > 0 and st[-1][0] == '(' and ch == ')':
st.pop()
else:
st.append((ch, i))
remove = [i for ch, i in st]
remain_ch = []
for i, ch in enumerate(s):
if i not in remove:
remain_ch.append(ch)
return "".join(remain_ch)
class Solution:
def minRemoveToMakeValid(self, s: str) -> str:
ct = 0
res = []
for ch in s:
if ch == "(":
ct += 1
res.append(ch)
elif ch == ')':
if ct > 0:
ct -= 1
res.append(ch)
else:
res.append(ch)
for i in range(len(res) - 1, -1, -1): #δ»εεειεη»ζ
if ct == 0:
break
if res[i] == "(":
ct -= 1
res[i] = ""
return "".join(res)