LeetCode——032
来源:互联网 发布:淘宝店铺直播条件 编辑:程序博客网 时间:2024/05/22 02:22
/*
32. Longest Valid Parentheses My Submissions QuestionEditorial Solution
Total Accepted: 60805 Total Submissions: 271732 Difficulty: Hard
Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.
For “(()”, the longest valid parentheses substring is “()”, which has length = 2.
Another example is “)()())”, where the longest valid parentheses substring is “()()”, which has length = 4.
Subscribe to see which companies asked this question
*/
/*
解题思路:
这道求最长有效括号比之前那道 Valid Parentheses 验证括号难度要大一些,这里我们还是借助栈来求解,需要定义个start变量来记录合法括号串的起始位置,我们遍历字符串,如果遇到左括号,则将当前下标压入栈,如果遇到右括号,如果当前栈为空,则将下一个坐标位置记录到start,如果栈不为空,则将栈顶元素取出,此时若栈为空,则更新结果和i - start + 1中的较大值,否则更新结果和i - 栈顶元素中的较大值,代码如下:
*/
class Solution {public: int longestValidParentheses(string s) { int res = 0, start = 0; stack<int> m; for (int i = 0; i < s.size(); ++i) { if (s[i] == '(') m.push(i); else if (s[i] == ')') { if (m.empty()) start = i + 1; else { m.pop(); res = m.empty() ? max(res, i - start + 1) : max(res, i - m.top()); } } } return res; }};
- LeetCode——032
- leetcode 032 —— Longest Valid Parentheses
- 开始刷刷Leetcode—leetcode第二题
- LeetCode —— Combinations
- LeetCode —— Triangle
- LeetCode —— Anagrams
- [leetcode] Subsets——@
- Permutations——LeetCode
- minimum_window_substring ——leetcode
- LeetCode——Candy
- LeetCode——Triangle
- LeetCode——Combinations
- LeetCode——Permutations
- *candy——leetcode
- gas_station——leetcode
- LeetCode——Candy
- LeetCode——Triangle
- LeetCode——Anagrams
- Android简单实用的自定义Dialog
- 非arc 转 arc
- 营销型网站发展
- json学习网站
- Notepad++ & MinGW(gcc...) 编译环境搭建
- LeetCode——032
- 线程和进程
- 数学建模第一天培训
- Android强制弹出软键盘
- [sublime text]将就能用的MIPS SPIM ASM代码高亮
- qt控件基本应用
- LeetCode 153 Find Minimum in Rotated Sorted Array
- 你的 Bitmap 究竟占多大内存?
- Java基础复习(一)