leetcode.cn 2026-10-03
🔴32.longest-valid-parentheses
🏷️ Tags
#stack #string #dynamic_programming #bracket_sequences
🔴32.longest-valid-parentheses
🏷️ Tags
#stack #string #dynamic_programming #bracket_sequences
Telegraph
longest-valid-parentheses
给你一个只包含 '(' 和 ')' 的字符串,找出最长有效(格式正确且连续)括号 子串 的长度。 左右括号匹配,即每个左括号都有对应的右括号将其闭合的字符串是格式正确的,比如 "(()())"。 示例 1: 输入:s = "(()" 输出:2 解释:最长有效括号子串是 "()" 示例 2: 输入:s = ")()())" 输出:4 解释:最长有效括号子串是 "()()" 示例 3: 输入:s = "" 输出:0 提示:
leetcode.com 2026-10-03
🔴32.longest-valid-parentheses
🏷️ Tags
#stack #string #dynamic_programming #bracket_sequences
🔴32.longest-valid-parentheses
🏷️ Tags
#stack #string #dynamic_programming #bracket_sequences
Telegraph
longest-valid-parentheses
Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Example 1: Input: s = "(()" Output: 2 Explanation: The longest valid parentheses substring is "()". Example 2: Input:…
leetcode.cn 2026-10-04
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
Telegraph
valid-parenthesis-string
给你一个只包含三种字符的字符串,支持的字符类型分别是 '('、')' 和 '*'。请你检验这个字符串是否为有效字符串,如果是 有效 字符串返回 true 。 有效 字符串符合如下规则:
leetcode.com 2026-10-04
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
Telegraph
valid-parenthesis-string
Given a string s containing only three types of characters: '(', ')' and '*', return true if s is valid. The following rules define a valid string:
leetcode.cn 2026-10-06
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-add-to-make-parentheses-valid
只有满足下面几点之一,括号字符串才是有效的:
leetcode.com 2026-10-06
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-add-to-make-parentheses-valid
A parentheses string is valid if and only if:
leetcode.cn 2026-10-09
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-insertions-to-balance-a-parentheses-string
给你一个括号字符串 s ,它只包含字符 '(' 和 ')' 。一个括号字符串被称为平衡的当它满足:
leetcode.com 2026-10-09
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-insertions-to-balance-a-parentheses-string
Given a parentheses string s containing only the characters '(' and ')'. A parentheses string is balanced if: