LeetCode 32 最长有效括号

Posted 2022-06-14 Starzkg

https://leetcode-cn.com/problems/longest-valid-parentheses/

解决方案

class Solution 
    public int longestValidParentheses(String s) 
        int maxans = 0;
        LinkedList<Integer> stack = new LinkedList<>();
        stack.push(-1);
        for (int i = 0; i < s.length(); i++) 
            if (s.charAt(i) == '(') 
                stack.push(i);
             else 
                stack.pop();
                if (stack.isEmpty()) 
                    stack.push(i);
                 else 
                    maxans = Math.max(i - stack.peek(), maxans);
                
            
        
        return maxans;
    

开发者涨薪指南 48位大咖的思考法则、工作方式、逻辑体系