您的位置:首页 > 其它

【leetcode】20. Valid Parentheses

2016-05-24 12:40 337 查看
/**
* 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 <vector>
#include <stack>

using namespace std;

bool isValid(string s)
{
stack<char> char_stack;

for (int i = 0; i < s.length(); i++)
{
if (s[i] == '(' || s[i] == '{' || s[i] == '[')
{
char_stack.push(s[i]);
}
else if (s[i] == ')' || s[i] == '}' || s[i] == ']')
{
if (s[i] == ')' && char_stack.top() == '(')
{
char_stack.pop();
}
else if (s[i] == '}' && char_stack.top() == '{')
{
char_stack.pop();
}
else if (s[i] == ']' && char_stack.top() == '[')
{
char_stack.pop();
}
else
{
return false;
}
}
else
continue;
}
return char_stack.empty();
}

int main()
{
string str = "([)]";

cout << isValid(str);
system("pause");
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: