leetcode---Valid Parentheses

最新推荐文章于 2019-01-24 01:21:41 发布

谛听-

最新推荐文章于 2019-01-24 01:21:41 发布

阅读量238

点赞数

分类专栏：题

本文链接：https://blog.csdn.net/u012319493/article/details/51045006

版权

题专栏收录该内容

456 篇文章 1 订阅

订阅专栏

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) {
        stack<char> sk;
        int len = s.length();
        if(len == 1)
            return false;
        for(int i=0; i<len; i++)
        {
            if(s[i] == '(' || s[i] == '[' || s[i] == '{')
                sk.push(s[i]);
            else if(s[i] == ')')
                if(sk.size() ==0)
                    return false;
                else if(sk.top() != '(')
                    return false;
                else
                    sk.pop();
            else if(s[i] == ']')
                if(sk.size() ==0)
                    return false;
                else if(sk.top() != '[')
                    return false;
                else
                    sk.pop();
            else if(s[i] == '}')
                if(sk.size() ==0)
                    return false;
                else if(sk.top() != '{')
                    return false;
                else
                    sk.pop();
        }
        if(sk.size() > 0)
            return false;
        return true;
    }
};