leetcode 20 Valid Parentheses

标签：top   pre   push   pop   ring   ++   amp   tac   stack   

class Solution {
public:
    bool isValid(string s) {
        stack<char> parentheses;
        for (int i = 0; i < s.size(); ++i) {
            if (s[i] == ‘(‘ || s[i] == ‘[‘ || s[i] == ‘{‘) parentheses.push(s[i]);
            else {
                if (parentheses.empty()) return false;
                if (s[i] == ‘)‘ && parentheses.top() != ‘(‘) return false;
                if (s[i] == ‘]‘ && parentheses.top() != ‘[‘) return false;
                if (s[i] == ‘}‘ && parentheses.top() != ‘{‘) return false;
                parentheses.pop();
            }
        }
        return parentheses.empty();
    }
}; 

leetcode 20 Valid Parentheses

标签：top   pre   push   pop   ring   ++   amp   tac   stack   

原文地址：http://www.cnblogs.com/wangkun1993/p/6388142.html