Longest|Longest Valid Parentheses
class Solution {
public int longestValidParentheses(String s) {
int len = s.length();
int max = 0;
int[] longest = new int[len];
for(int i=1;
i=2?longest[i-2]:0) + 2;
max = longest[i] > max ? longest[i] :max;
}else {
if(i - longest[i-1] - 1>=0 && s.charAt(i - longest[i-1] - 1) == '('){
longest[i] = (longest[i-1] + 2) + ((i-longest[i-1]-2)>=0?longest[i-longest[i-1]-2]:0);
max = longest[i] > max ? longest[i] :max;
}
}
}}
return max;
}
【Longest|Longest Valid Parentheses】}
推荐阅读
- 解决SyntaxError:|解决SyntaxError: invalid syntax
- LeetCode（03）Longest|LeetCode（03）Longest Substring Without Repeating Characters
- cannot|cannot be read or is not a valid ZIP file
- mac升级之（xcrun:|mac升级之：xcrun: error: invalid active developer path, missing xcrun）
- element-ui表单验证例子（validateField验证部分表单）
- 寻找写代码感觉（十六）之|寻找写代码感觉（十六）之 集成Validation做参数校验
- Unable|Unable to add window -- token null is not valid; is your activity running?
- RpcException:|RpcException: Invalid token! Failed to invoke method
- 解决vue项目中的“Invalid|解决vue项目中的“Invalid Host header”
- python|leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法