Title: leetcode32-最长有效括号 | snmlm
Open Graph Title: leetcode32-最长有效括号
Description: 题目描述给你一个只包含 '(' 和 ')' 的字符串,找出最长有效(格式正确且连续)括号子串的长度。 示例 1: 123输入:s = "(()"输出:2解释:最长有效括号子串是 "()" 示例 2: 123输入:s = ")()())"输出:4解释:最长有效括号子串是 "()()"
Open Graph Description: 题目描述给你一个只包含 '(' 和 ')' 的字符串,找出最长有效(格式正确且连续)括号子串的长度。 示例 1: 123输入:s = "(()"输出:2解释:最长有效括号子串是 "()" 示例 2: 123输入:s = ")()())"输出:4解释:最长有效括号子串是 "()()"
Keywords:
Mail addresses
undefined
Opengraph URL: https://snmlm.github.io/algorithm/leetcode/leetcode_32/
Generator: Hexo 5.1.1
Domain: snmlm.github.io
| None | no-siteapp |
| author | snmlm |
| copyright | snmlm |
| format-detection | telephone=no |
| theme-color | #ffffff |
| og:type | article |
| og:site_name | snmlm |
| og:image | https://snmlm.github.io/img/head.gif |
| article:published_time | 2023-05-03T16:00:00.000Z |
| article:modified_time | 2023-05-04T09:09:37.986Z |
| twitter:card | summary |
Links:
Viewport: width=device-width,initial-scale=1