Jaypedia

Algorithm문제풀이: LeetCode의 “20. Valid Parentheses” (easy)

Leetcode의 Top Interview Questions Easy Collection 중에 Others 문제입니다.

Algorithm문제풀이: LeetCode의 “20. Valid Parentheses” (easy)
🧑‍🚀문제링크: https://leetcode.com/problems/valid-parentheses/

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
 
Example 1:
Input: s = "()"
Output: true
 
Example 2:
Input: s = "()[]{}"
Output: true
 
Example 3:
Input: s = "(]"
Output: false
 
 
Constraints:
1 <= s.length <= 104
s consists of parentheses only '()[]{}'.
 

여러분은 어떻게 해결하셨나요? 솔루션을 댓글로 달아주세요~~!

걸스인텍 정다은