921. Minimum Add to Make Parentheses Valid

最新推荐文章于 2024-06-22 09:00:00 发布

ForABiggerWorld

最新推荐文章于 2024-06-22 09:00:00 发布

阅读量197

点赞数

分类专栏： leetcode stack

本文链接：https://blog.csdn.net/zjucor/article/details/83045419

版权

leetcode 同时被 2 个专栏收录

558 篇文章 0 订阅

订阅专栏

stack

18 篇文章 0 订阅

订阅专栏

Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the resulting parentheses string is valid.

Formally, a parentheses string is valid if and only if:

It is the empty string, 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.

Given a parentheses string, return the minimum number of parentheses we must add to make the resulting string valid.

Example 1:

Input: "())"
Output: 1

Example 2:

Input: "((("
Output: 3

Example 3:

Input: "()"
Output: 0

Example 4:

Input: "()))(("
Output: 4

Note:

S.length <= 1000
S only consists of '(' and ')' characters.

思路：用stack模拟一遍，stack里面只放(，遇到)，如果stack为空，就+1，否则pop stack

class Solution(object):
    def minAddToMakeValid(self, S):
        """
        :type S: str
        :rtype: int
        """
        res=0
        st=[]
        for s in S:
            if s=='(': 
                st.append(s)
            else:
                if not st: res+=1
                else: st.pop()
        res+=len(st)
        return res
    
s=Solution()
print(s.minAddToMakeValid("())"))
print(s.minAddToMakeValid("((("))
print(s.minAddToMakeValid("()"))
print(s.minAddToMakeValid("()))(("))