mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
36 lines
1.1 KiB
Markdown
36 lines
1.1 KiB
Markdown
<h2><a href="https://leetcode.com/problems/valid-parentheses/">20. Valid Parentheses</a></h2><h3>Easy</h3><hr><div><p>Given a string <code>s</code> containing just the characters <code>'('</code>, <code>')'</code>, <code>'{'</code>, <code>'}'</code>, <code>'['</code> and <code>']'</code>, determine if the input string is valid.</p>
|
|
|
|
<p>An input string is valid if:</p>
|
|
|
|
<ol>
|
|
<li>Open brackets must be closed by the same type of brackets.</li>
|
|
<li>Open brackets must be closed in the correct order.</li>
|
|
</ol>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre><strong>Input:</strong> s = "()"
|
|
<strong>Output:</strong> true
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre><strong>Input:</strong> s = "()[]{}"
|
|
<strong>Output:</strong> true
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre><strong>Input:</strong> s = "(]"
|
|
<strong>Output:</strong> false
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
|
|
<li><code>s</code> consists of parentheses only <code>'()[]{}'</code>.</li>
|
|
</ul>
|
|
</div> |