solution/1100-1199/1111.Maximum Nesting Depth of Two Valid Parentheses Strings/Solution.java at main - Yohann-study/leetcode

main

leetcode

A

solution\1100-1199\1111.Maximum Nesting Depth of Two Valid Parentheses Strings\Solution.java

3 Complexity
3 Complexity / M
0 Duplication
1 Churn
13 Lines
13 Lines of Code
1 Methods
13 LOC / Method

{{getIssueFilterCount()}}

Autofix is being processed.

Found in

{{::issue.Locations[0].Path}}

Found in

{{::location.Path}}:{{::location.StartLine}}-{{::location.EndLine}} ,

{{::lineNumber}}

No issues found

“

Any fool can write code that a computer can understand. Good programmers write code that humans can understand.

– Martin Fowler