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

1111. Maximum Nesting Depth of Two Valid Parentheses Strings

Leetcode Solutions

Initialize a variable depth to keep track of the current depth level, starting at 0.
Initialize an empty list result to store the group assignment for each parenthesis.
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.
Return the result list containing the group assignments.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen