class Solution {
public:
bool isValid(string s) {
string left="{[(",right="}])";
stack<char>st;
for(auto c:s)
{
if(left.find(c)!=string::npos)
st.push(c);
else{
if(st.empty()||st.top()!=left[right.find(c)])
return false;
st.pop();
}
}
return st.empty();
}
};
https://leetcode-cn.com/problems/valid-parentheses/
https://leetcode.com/problems/valid-parentheses/descripti...
https://leetcode.com/problems/valid-parentheses/descripti...
https://leetcode-cn.com/problems/valid-parentheses/descri...
题目来源： https://leetcode-cn.com/problems/valid-parentheses/...
https://leetcode-cn.com/problems/valid-parentheses/descri...
链接：https://leetcode.com/problems/valid-parentheses/#/desc...
题目链接[https://leetcode-cn.com/problems/valid-parentheses/]...
https://leetcode.com/problems/valid-parentheses/ My answe...
本文标题：valid-parentheses
本文链接：https://www.haomeiwen.com/subject/wfyisctx.html
网友评论