LeetCode 020. Valid Parentheses

最新推荐文章于 2015-01-18 15:01:37 发布

雪水

最新推荐文章于 2015-01-18 15:01:37 发布

阅读量881

点赞数

分类专栏： Leetcode LeetCode - C++ 文章标签： LeetCode Valid Parentheses

本文链接：https://blog.csdn.net/wanghuiqi2008/article/details/37960449

版权

Leetcode 同时被 2 个专栏收录

30 篇文章 0 订阅

订阅专栏

LeetCode - C++

30 篇文章 7 订阅

订阅专栏

Valid Parentheses

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) 
    {
        int len = s.length();
        string stack(len,' ');
        int j = -1;
        for(int i=0; i<len; i++)
        {
            //左括号，则入栈
            if(s[i]=='(' || s[i]=='[' || s[i]=='{')
            {
                j++;
                stack[j] = s[i];
            }
            //右括号，则出栈一个元素与之对比
            if(s[i]==')' || s[i]==']' || s[i]=='}')
            {
                if(j < 0) //栈为空
                    return false;
				if((stack[j]=='('&&s[i]!=')')||(stack[j]=='['&&s[i]!=']')||(stack[j]=='{'&&s[i]!='}'))
                    return false;
                else
                    j--;
            }
        }
        if(j >= 0)  //左括号还有剩余
            return false;
        else 
            return true;
    }
};