LeetCode - 20. Valid Parentheses
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode - 20. Valid Parentheses相关的知识,希望对你有一定的参考价值。
20. Valid Parentheses
Problem‘s Link
----------------------------------------------------------------------------
Mean:
给定一个括号序列,检查括号是否按顺序匹配.
analyse:
栈结构的基本运用.
Time complexity: O(N)
view code
/**
* -----------------------------------------------------------------
* Copyright (c) 2016 crazyacking.All rights reserved.
* -----------------------------------------------------------------
* Author: crazyacking
* Date : 2016-02-17-16.33
*/
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long(LL);
typedef unsigned long long(ULL);
const double eps(1e-8);
class Solution
{
public:
bool isValid(string s)
{
stack<char> sta;
for(auto p:s)
{
if(p==‘(‘ || p==‘{‘ || p==‘[‘)
sta.push(p);
else if(p==‘)‘)
{
if(sta.empty()) return false;
char tp=sta.top();
sta.pop();
if(tp!=‘(‘)
return false;
}
else if(p==‘}‘)
{
if(sta.empty()) return false;
char tp=sta.top();
sta.pop();
if(tp!=‘{‘)
return false;
}
else
{
if(sta.empty()) return false;
char tp=sta.top();
sta.pop();
if(tp!=‘[‘)
return false;
}
}
if(sta.empty())
return true;
else return false;
}
};
int main()
{
Solution solution;
string s;
while(cin>>s)
{
if(solution.isValid(s))
cout<<"Yes."<<endl;
else cout<<"No."<<endl;
}
return 0;
}
/*
*/
* -----------------------------------------------------------------
* Copyright (c) 2016 crazyacking.All rights reserved.
* -----------------------------------------------------------------
* Author: crazyacking
* Date : 2016-02-17-16.33
*/
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long(LL);
typedef unsigned long long(ULL);
const double eps(1e-8);
class Solution
{
public:
bool isValid(string s)
{
stack<char> sta;
for(auto p:s)
{
if(p==‘(‘ || p==‘{‘ || p==‘[‘)
sta.push(p);
else if(p==‘)‘)
{
if(sta.empty()) return false;
char tp=sta.top();
sta.pop();
if(tp!=‘(‘)
return false;
}
else if(p==‘}‘)
{
if(sta.empty()) return false;
char tp=sta.top();
sta.pop();
if(tp!=‘{‘)
return false;
}
else
{
if(sta.empty()) return false;
char tp=sta.top();
sta.pop();
if(tp!=‘[‘)
return false;
}
}
if(sta.empty())
return true;
else return false;
}
};
int main()
{
Solution solution;
string s;
while(cin>>s)
{
if(solution.isValid(s))
cout<<"Yes."<<endl;
else cout<<"No."<<endl;
}
return 0;
}
/*
*/
以上是关于LeetCode - 20. Valid Parentheses的主要内容,如果未能解决你的问题,请参考以下文章
[LeetCode]20. Valid Parentheses
[LeetCode]20 Valid Parentheses 有效的括号
LeetCode OJ 20Valid Parentheses