목록32. Longest Valid Parentheses (1)

Scribbling

32. Longest Valid Parentheses

무지성 포칼포인트의 답... class Solution: def longestValidParentheses(self, s: str) -> int: if not s: return 0 mem = [0] * len(s) stack = [] length = 0 for i in range(len(s)): char = s[i] if char == '(': stack.append(char) length = 0 else: if not stack: length = 0 else: top = stack.pop() if top == '(': length += 2 if i - length >= 0 and s[i-length] == ')': length += mem[i-length] else: length = 0 mem[i] =..
Computer Science/Coding Test 2021. 9. 4. 00:13
이전 Prev 1 Next 다음