leetcode字符串dp——32. Longest Valid Parentheses
来源：互联网 发布：手游编程用什么软件 编辑：程序博客网 时间：2024/05/22 06:18
class Solution { public int longestValidParentheses(String s) { int dp[] = new int[s.length()]; for(int i = 0; i < s.length(); ++i) { if(s.charAt(i) == '(') dp[i] = 0; else { if(i - 1 >= 0 && s.charAt(i-1) == '(') { if(i-2 >= 0) { dp[i] = dp[i-2] + 2; } else { dp[i] = 2; } } else if(i - 1 >= 0 && i-dp[i-1]-1>= 0 && s.charAt(i-dp[i-1]-1) == '(') { dp[i] = dp[i-1] + 2; if(i-dp[i-1]-2 >= 0) { dp[i] += dp[i-dp[i-1]-2]; } } } }// for(int i = 0; i < s.length(); ++i) {// System.out.print(dp[i] + " ");// }// System.out.println(); int res = 0; for(int i = 0; i < s.length(); ++i) { res = Math.max(res, dp[i]); } return res; } public static void main(String[] args) { Solution solution = new Solution(); solution.longestValidParentheses("()(())"); }}阅读全文
0 0
- leetcode字符串dp——32. Longest Valid Parentheses
- Leetcode——32. Longest Valid Parentheses
- [leetcode] Longest Valid Parentheses DP~!
- leetcode 032 —— Longest Valid Parentheses
- leetcode题集——longest-valid-parentheses
- LeetCode—32 Longest Valid Parentheses
- leetcode 32. Longest Valid Parentheses——（use stack）
- 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
- LeetCode 32. Longest Valid Parentheses
- [leetcode] 32. Longest Valid Parentheses
- LeetCode 32. Longest Valid Parentheses
- LeetCode-32.Longest Valid Parentheses
- 两台电脑上的虚拟机之间相互通信
- 在Eclipse中测试MySQL-JDBC（2）优化【数据库查询】
- 170906_Spring英文文档阅读（二）_2.2 Data Access/Integration_spring-orm
- unity调用系统的webview 显示活动公告 Scroll =“no” 在ios上不生效
- 如何在eclipse里配置maven插件
- leetcode字符串dp——32. Longest Valid Parentheses
- 内核级虚拟化技术
- fstream、ifstream、ofstream创建新文件
- java基础之值传递和引用传递
- struts2下的后台Action层获取页面导入的excel数据并解析
- Request源码阅读(持续更新中)
- ThreadLocal & InheritableThreadLocal
- vim 显示/取消行号
- 四大线程池详解
