Longest Valid Parentheses_Leetcode_#32
来源:互联网 发布:python是什么语言 编辑:程序博客网 时间:2024/06/07 04:43
1 题目
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.
2 解法
public class Solution { public int longestValidParentheses(String s) { int size = s.length(); Stack<Integer> stack = new Stack<Integer>(); stack.push(-1); int result = 0; for(int i = 0; i < size; i++){ if(s.charAt(i) == ')' && stack.size() > 1 && s.charAt(stack.peek()) == '('){ stack.pop(); result = Math.max(result, i - stack.peek()); }else{ stack.push(i); } } return result; }}
0 0
- Longest Valid Parentheses_Leetcode_#32
- Valid Parentheses_Leetcode_#20
- [32] Longest Valid Parentheses
- 32Longest Valid Parentheses
- 32Longest Valid Parentheses
- 【32】Longest Valid Parentheses
- 32-Longest Valid Parentheses
- 32-longest valid parentheses
- LeetCode(32)Longest Valid Parentheses
- [Leetcode] #32 Longest Valid Parentheses
- [leetccode 32] Longest Valid Parentheses
- [Leetcode] 32 - Longest Valid Parentheses
- LeetCode 32 Longest Valid Parentheses
- Leetcode 32 Longest Valid Parentheses
- leetcode 32 -- Longest Valid Parentheses
- LeetCode---(32)Longest Valid Parentheses
- leetcode 32 : Longest Valid Parentheses
- leetcode 32: Longest Valid Parentheses
- PAT advanced-1003详解
- 【华为OJ】汽水瓶
- Android Retrofit+rxjava+okhttp请求网络的基本用法
- CGI 与 Servlet
- Linux设备模型firmware(固件)
- Longest Valid Parentheses_Leetcode_#32
- us/os-ll实时系统
- SUMO文档001:简介
- Android酷炫动画效果之3D星体旋转效果
- MAC安装apache tomcat配置方法图文教程
- EasyUI combotree 使用递归动态填数据
- Java泛型总结
- REDIS实践之在线人数统计几种方案分析
- 7.6 QPOJ 2955Brackets