class Solution {
public:
bool isValid(string s) {
int sizes=s.length();
stack <char> my_stack;
for (int i=0;i<sizes;i++)
{
if (s[i]=='('||s[i]=='['||s[i]=='{')
my_stack.push(s[i]);
else if (s[i]==')'||s[i]==']'||s[i]=='}')
{
if (my_stack.empty())
return false;
else{
if ((s[i] == ')' && my_stack.top() == '(') ||
(s[i] == ']' && my_stack.top() == '[') ||
(s[i] == '}' && my_stack.top() == '{'))
{
my_stack.pop();
}
else
return false;
}
}
}
return my_stack.empty();
}
};
力扣有效的括号
最新推荐文章于 2025-04-29 12:29:58 发布