LeetCode: Valid Parentheses [020]

最新推荐文章于 2024-10-07 07:09:00 发布

HarryHuang1990

最新推荐文章于 2024-10-07 07:09:00 发布

阅读量711

点赞数

分类专栏：面试算法文章标签： leetcode 算法面试

本文链接：https://blog.csdn.net/harryhuang1990/article/details/25973405

版权

算法同时被 2 个专栏收录

159 篇文章 0 订阅

订阅专栏

面试

151 篇文章 0 订阅

订阅专栏

【题目】

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.

【题意】

判断给定的字符串是否是合法的成对括号串

【思路】

栈

【代码】

class Solution {
public:
    bool isPair(char left, char right){
        if(left=='('&&right==')')return true;
        if(left=='{'&&right=='}')return true;
        if(left=='['&&right==']')return true;
        return false;
    }
    bool isValid(string s) {
        stack<int>st;
        for(int i=0; i<s.length(); i++){
            if(st.empty())st.push(s[i]);
            else{
                char left=st.top();
                if(isPair(left,s[i]))st.pop();
                else st.push(s[i]);
            }
        }
        return st.empty();
    }
};