leetcode-301-Remove Invalid Parentheses

本文探讨了如何使用变量检查括号匹配的有效性,并通过删除重复括号优化字符串。提出了有效字符串判断的规则:未达结尾左括号数量大于等于右括号,结尾时左右相等。使用深度优先搜索遍历括号。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Error:

  1. s.erase() will erase the char in s then return!!! If you want to get the s.erase and s, it should use another string to store s then erase the char
  2. Do not know how to do: when an parenthese is valid will have:
    - If i not in the end, left >= right
    - If i meet the end, left == right

    In other word, any string do not has this case is invalid, so that we can use a variable to check it.
    Then, we first delete the first parenthese when meet duplicate

update:
pattern:
1. valid current string is valid or not. By using rule: if not meet the end, '('s number is greater than ‘)’; if meet the end, ‘(’ is equal to ‘)’
2. check original string mistake parenthesis. By using the same rule above.
3. use dfs the traverse the ‘(’ and ‘)’.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值