Valid Parentheses——解题报告

标签：leetcode   栈   匹配   括号   

    【题目】

    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 isValid(string s) {
        if(s.length() == 0)
            return true;
        
        stack<int> sta;
        for(int i = 0; i < s.length(); i++)
        {
            if(s[i] == '(' || s[i] == '[' || s[i] == '{')
                sta.push(s[i]);
            else if(s[i] == ')')
            {
                if(sta.empty() || sta.top() != '(')
                    return false;
                else
                    sta.pop();
            }
            else if(s[i] == ']')
            {
                if(sta.empty() || sta.top() != '[')
                    return false;
                else
                    sta.pop();
            }
            else
            {
                if(sta.empty() || sta.top() != '{')                
                    return false;
                else
                    sta.pop();
            }
        }
        
        if(sta.empty())
            return true;
        else
            return false;
    }
};

Valid Parentheses——解题报告

标签：leetcode   栈   匹配   括号   

原文地址：http://blog.csdn.net/puqutogether/article/details/45576349