g0001_0100.s0020_valid_parentheses.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
20\. Valid Parentheses
Easy
Given a string `s` containing just the characters `'('`, `')'`, `'{'`, `'}'`, `'['` and `']'`, determine if the input string is valid.
An input string is valid if:
1. Open brackets must be closed by the same type of brackets.
2. 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
**Example 4:**
**Input:** s = "([)]"
**Output:** false
**Example 5:**
**Input:** s = "{[]}"
**Output:** true
**Constraints:**
* 1 <= s.length <= 104
* `s` consists of parentheses only `'()[]{}'`.