[leetcode] 1111. Maximum Nesting Depth of Two Valid Parentheses Strings

Description

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

分析

题目的意思是：给定一个包含括号的字符串，现在分割成两个合法的子字符串，即括号要匹配，求满足最小深度的情况的字符串被分的情况，0表示被分到第一个字符串上，1表示被分到第二个字符串上。首先要求出字符串的深度，可以用栈，也可以计数。然后最小深度最原字符串最大深度的一半，所以再次遍历字符串，用cnt统计深度，把满足当前深度大于一半的位置设置成1，其他位置设置成0就行了。

代码

class Solution:
    def maxDepthAfterSplit(self, seq: str) -> List[int]:
        cnt=0
        maxL=0
        for ch in seq:
            if(ch=='('):
                cnt+=1
            else:
                cnt-=1
            maxL=max(maxL,cnt)
        res=[]
        half=maxL/2
        cnt=0
        for ch in seq:
            if(ch=='('):
                cnt+=1
                if(cnt>half):
                    res.append(1)
                else:
                    res.append(0)
            else:
                if(cnt>half):
                    res.append(1)
                else:
                    res.append(0)
                cnt-=1
        return res

参考文献

[LeetCode] [Java/C++/Python] O(1) Extra Space Except Output