首页 > 代码库 > [leetcode]Valid Parentheses
[leetcode]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.
#include <iostream>#include <string>#include <stack>#include <map>using namespace std;class Solution {private: map<char,char> pairs; stack<int> pstack;public: Solution() { pairs[‘)‘] = ‘(‘; pairs[‘}‘] = ‘{‘; pairs[‘]‘] = ‘[‘; } bool isValid(string s) { int len = s.length(); if(len%2)return false; int i = 0; map<char,char>::iterator it; char sen; for(i = 0; i < len; i++){ it = pairs.find(s[i]); if(it == pairs.end()){ pstack.push(s[i]); continue; } sen = it ->second; if(!pstack.empty()){ char tmp = pstack.top(); if(tmp == sen){ pstack.pop(); }else{ return false; } }else{ return false; } } if(pstack.empty())return true; return false; }};int main(){ Solution s = Solution(); cout << s.isValid("[{}]{{}()}") << endl; return 0;}
[leetcode]Valid Parentheses
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。