[leetcode] problem 32 – longest valid parentheses

public int (String s) {
    int result = 0;
    int[] d = new int[s.length()];

    
    // "(...))": d[i] = d[i-1] + d[i - d[i-1] - 2] + 2
    for (int i = 1; i < s.length(); i++) {
        if (s.charAt(i) == ')') {
            if (s.charAt(i - 1) == '(')
                d[i] = (i >= 2 ? d[i - 2] : 0) + 2;
            else if (i - d[i - 1] >= 1 && s.charAt(i - d[i - 1] - 1) == '(')
                d[i] = d[i - 1] + (i - d[i - 1] >= 2 ? d[i - d[i - 1] - 2] : 0) + 2;

            result = Math.max(result, d[i]);
        }
    }

    return result;
}