LeetCode知识点总结 - 921

最新推荐文章于 2024-02-14 18:55:42 发布

jeeeee_no

最新推荐文章于 2024-02-14 18:55:42 发布

阅读量367

点赞数 5

分类专栏： LeetCode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/m0_59773145/article/details/135819725

版权

LeetCode 专栏收录该内容

417 篇文章 1 订阅

订阅专栏

该篇文章介绍了如何使用贪心策略解决LeetCode中的921题——MinimumAddToMakeValid，通过计算在给定括号字符串中插入最少数量的括号使其有效的方法。主要思路是利用栈来跟踪未匹配的左括号，遇到右括号时进行计数和调整。

摘要由CSDN通过智能技术生成

LeetCode 921. Minimum Add to Make Parentheses Valid

考点	难度
Greedy	Easy

题目

A parentheses string is valid if and only if:

It is the empty string,
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.
You are given a parentheses string s. In one move, you can insert a parenthesis at any position of the string.

For example, if s = “()))”, you can insert an opening parenthesis to be “(()))” or a closing parenthesis to be “())))”.
Return the minimum number of moves required to make s valid.

思路

遇到左括号就加到stack，遇到右括号如果stack是空的c+1，如果stack不是空的就pop一个。

答案

class Solution:
    def minAddToMakeValid(self, s):
        stack=[]
        c=0
        for i in s:
            if i=='(':
                stack.append(i)
                continue
            if i==')':
                if not stack:
                    c+=1
                else:
                    if stack[-1]=='(':
                        stack.pop()
                continue
            c+=1
        return c+len(stack)