목록2024/04/04 (1)

넘치게 채우기

[LeetCode] 1614. Maximum Nesting Depth of the Parentheses

https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/description/ Leetcode - Maximum Nesting Depth of the Paretheses 문제 유형 : 문자열 처리, 스택 문제 난이도 : Easy 문제 A string is a valid parentheses string (denoted VPS) if it meets one of the following: It is an empty string "", or a single character not equal to "(" or ")", It can be written as AB (A concatenated with B), where A and B are ..
PS/LeetCode 2024. 4. 4. 15:44
이전 Prev 1 Next 다음