码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] Valid Parentheses

时间:2015-08-28 10:54:32      阅读:133      评论:0      收藏:0      [点我收藏+]

标签:

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.size() == 0) {
      return true;
    }
    if (s.size() % 2) {
     return false;
    }

    stack<char> stack_;
    for(int i = 0; i < s.size(); ++i) {
      char c0 = s[i];
      if(c0 == ‘(‘ || c0 == ‘[‘ || c0 ==‘{‘) {
        stack_.push(c0);
      }
      else {
        if (stack_.empty()) {
          return false;
        }
        char& c1 = stack_.top();
        if ( (c1 == ‘(‘ && c0 != ‘)‘) ||
          (c1 == ‘[‘ && c0 != ‘]‘) ||
          (c1 == ‘{‘ && c0 != ‘}‘) ) {
          return false;
        }
        stack_.pop();
      }
    }
    if (stack_.empty()) {
      return true;
    }
    return false;
  }

};

[LeetCode] Valid Parentheses

标签:

原文地址:http://www.cnblogs.com/shoemaker/p/4765785.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!