【8】20. Valid Parentheses

最新推荐文章于 2024-02-05 23:11:57 发布

weixin_30488313

最新推荐文章于 2024-02-05 23:11:57 发布

阅读量40

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/93scarlett/p/6362009.html

本文介绍了一种使用栈数据结构来验证括号字符串是否有效的算法。该算法通过遍历输入字符串，利用栈来匹配和验证每一对括号，确保它们正确闭合。文章提供了详细的C++实现代码。

20. Valid Parentheses

Total Accepted: 167254
Total Submissions: 517330
Difficulty: Easy
Contributors: Admin

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.

Solution:

Use stack. When we meet a left parentheses, we push it into the stack. When we meet a right parentheses, we will return false if the stack is empty, otherwise, we will pop the top of the stack to find if it is the corresponding left parentheses.

 1 class Solution {
 2 public:
 3     bool isValid(string s) {
 4         stack<char> st;
 5         for(int i = 0; i < s.size(); i++){
 6             if(s[i] == '(' || s[i] == '{' || s[i] == '['){
 7                 st.push(s[i]);
 8             }else if(s[i] == ')' || s[i] == '}' || s[i] == ']'){
 9                 if(st.empty()){
10                     return false;
11                 }else{//只需判断false的情况，最后再pop就可以了
12                     if(s[i] == ')' && st.top() != '(') return false;
13                     if(s[i] == ']' && st.top() != '[') return false;
14                     if(s[i] == '}' && st.top() != '{') return false;
15                     st.pop();
16                 }
17             }
18         }
19         //return true;此时不能直接return true，因为stack里可能会有剩余的左括号
20         return st.empty();
21     }
22 };