Valid Parentheses

hy_hd

于 2017-05-21 12:01:43 发布

阅读量135

点赞数

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

本文链接：https://blog.csdn.net/hanyong_hd/article/details/72597312

版权

算法专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Valid Parentheses

Tags： leetcode, 算法

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.

2. 解答

#include <string>
#include <stack>

using namespace std;

class Solution {
public:
    bool isValid(string s) {
       stack<char> chStack;
       for (string::size_type i = 0; i < s.size(); ++i) {
           switch (s[i]) {
                case '(':
                case '{':
                case '[' :
                    chStack.push(s[i]);
                    break;
                case ')':
                    if (chStack.empty() || chStack.top() != '(') {
                        return false;
                    }
                    chStack.pop();
                    break;
                case '}':
                    if (chStack.empty() || chStack.top() != '{') {
                        return false;
                    }
                    chStack.pop();
                    break;
                case ']':
                    if (chStack.empty() || chStack.top() != '[') {
                        return false;
                    }
                    chStack.pop();
                    break;
                default:
                    return false;
           }
       }
       if (chStack.empty()) {
           return true;
       }
       return false;
    }
};