Leetcode Problem 1111. Maximum Nesting Depth of Two Valid Parentheses Strings

1111. Maximum Nesting Depth of Two Valid Parentheses Strings

Leetcode Solutions

Alternating Depth Assignment

  1. Initialize a variable depth to keep track of the current depth level, starting at 0.
  2. Initialize an empty list result to store the group assignment for each parenthesis.
  3. Iterate over each character in the input string seq.
    • If the character is an opening parenthesis '(', increment the depth.
    • Assign the parenthesis to group 0 if depth is even, or to group 1 if depth is odd.
    • Append the group assignment to the result list.
    • If the character is a closing parenthesis ')', decrement the depth after the assignment.
  4. Return the result list containing the group assignments.
UML Thumbnail

Greedy Depth Assignment

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...