-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1111-MaximumNestingDepthOfTwoValidParenthesesStrings.go
More file actions
67 lines (55 loc) · 2.25 KB
/
1111-MaximumNestingDepthOfTwoValidParenthesesStrings.go
File metadata and controls
67 lines (55 loc) · 2.25 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package main
// 1111. 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
import "fmt"
// stack
func maxDepthAfterSplit(seq string) []int {
n, stack := len(seq), make([][2]int, 0)
res := make([]int, n)
for i := 0; i < n; i++ { res[i] = -1 } // fill -1
for i := range seq {
if seq[i] == '(' {
flip := 0
if len(stack) != 0 && stack[len(stack)-1][1] == 0 {
flip = 1
}
stack = append(stack, [2]int{ i, flip })
} else { // ')'
top := stack[len(stack)-1] // pop
stack = stack[:len(stack)-1]
res[top[0]] = top[1]
res[i] = top[1]
}
}
return res
}
func main() {
// Example 1:
// Input: seq = "(()())"
// Output: [0,1,1,1,1,0]
fmt.Println(maxDepthAfterSplit("(()())")) // [0,1,1,1,1,0]
// Example 2:
// Input: seq = "()(())()"
// Output: [0,0,0,1,1,0,1,1]
fmt.Println(maxDepthAfterSplit("()(())()")) // [0,0,0,1,1,0,1,1]
}