LeetCode.1111.Maximum Nesting Depth of Two Valid Parentheses Strings 有效括号的嵌套深度

题目描述

1111 Maximum Nesting Depth of Two Valid Parentheses Strings
https://leetcode-cn.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/

A string is a valid parentheses string (denoted VPS) if and only if it consists of “(“ and “)” characters only, and:

• It is the empty string, or
• It can be written as AB (A concatenated with B), where A and B are VPS’s, or
• It can be written as (A), where A is a VPS.

We can similarly define the nesting depth depth(S) of any VPS S as follows:

• depth(“”) = 0
• depth(A + B) = max(depth(A), depth(B)), where A and B are VPS’s
• depth(“(“ + A + “)”) = 1 + depth(A), where A is a VPS.

For example, “”, “()()”, and “()(()())” are VPS’s (with nesting depths 0, 1, and 2), and “)(“ and “(()” are not VPS’s.

Given a VPS seq, split it into two disjoint subsequences A and B, such that A and B are VPS’s (and A.length + B.length = seq.length).

Now choose any such A and B such that max(depth(A), depth(B)) is the minimum possible value.

Return an answer array (of length seq.length) that encodes such a choice of A and B: answer[i] = 0 if seq[i] is part of A, else answer[i] = 1. Note that even though multiple answers may exist, you may return any of them.

Example 1:

Input: seq = "(()())"
Output: [0,1,1,1,1,0]

Example 2:

Input: seq = "()(())()"
Output: [0,0,0,1,1,0,1,1]

Constraints:
1 <= seq.size <= 10000

解题过程

括号序列   ( ( ) ( ( ) ) ( ) )

private static class SolutionV2020 {
public int[] maxDepthAfterSplit(String seq) {
if (null == seq || 0 == seq.length()) {
return null;
}
int[] res = new int[seq.length()];
int stackSize = 0;
for (int i = 0; i < seq.length(); i++) {
if (seq.charAt(i) == '(') {
// 左括号入栈，栈深度加1
stackSize++;
// 栈深度是奇数的，归为第一组，偶数的归为第二组
res[i] = stackSize % 2 == 1 ? 0 : 1;
} else {
// 栈深度是奇数的，归为第一组，偶数的归为第二组
res[i] = stackSize % 2 == 1 ? 0 : 1;
// 右括号和栈顶抵消，栈深度减1
stackSize--;
}
}
return res;
}
}

GitHub代码

algorithms/leetcode/leetcode/_1111_NestingDepthOfValidParentheses.java
https://github.com/masikkk/algorithms/blob/master/leetcode/leetcode/_1111_NestingDepthOfValidParentheses.java

779

页面信息

location:
protocol:
host:
hostname:
origin:
pathname:
href:
document:
referrer:
navigator:
platform:
userAgent: