coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part6

Browse Source
This commit is contained in:
小墨
2022-03-27 20:56:26 +08:00
parent c11d601602
commit 08d1f2a596
1096 changed files with 88216 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
算法题（国内版）/problem (Chinese)/有效的括号 [valid-parentheses].html Normal file
View File

@@ -0,0 +1,53 @@
<p>给定一个只包括 <code>'('</code>，<code>')'</code>，<code>'{'</code>，<code>'}'</code>，<code>'['</code>，<code>']'</code> 的字符串 <code>s</code> ，判断字符串是否有效。</p>
<p>有效字符串需满足：</p>
<ol>
<li>左括号必须用相同类型的右括号闭合。</li>
<li>左括号必须以正确的顺序闭合。</li>
</ol>
<p> </p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入：</strong>s = "()"
<strong>输出：</strong>true
</pre>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入：</strong>s = "()[]{}"
<strong>输出：</strong>true
</pre>
<p><strong>示例 3：</strong></p>
<pre>
<strong>输入：</strong>s = "(]"
<strong>输出：</strong>false
</pre>
<p><strong>示例 4：</strong></p>
<pre>
<strong>输入：</strong>s = "([)]"
<strong>输出：</strong>false
</pre>
<p><strong>示例 5：</strong></p>
<pre>
<strong>输入：</strong>s = "{[]}"
<strong>输出：</strong>true</pre>
<p> </p>
<p><strong>提示：</strong></p>
<ul>
<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
<li><code>s</code> 仅由括号 <code>'()[]{}'</code> 组成</li>
</ul>