In the Leetcode Valid Parentheses problem solution in C++ programming Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Every close bracket has a corresponding open bracket of the same type.
Leetcode Valid Parentheses problem solution in C++ programming
class Solution {
public:
bool isValid(string s) {
vector<char> v;
for(int i=0;i<s.size();i++)
{
if(!v.empty() && ((v.back()=='(' && s[i]==')') || (v.back()=='[' && s[i]==']') || (v.back()=='{' && s[i]=='}')))
v.pop_back();
else
v.push_back(s[i]);
}
return v.empty();
}
};Also read,
- Leetcode Valid Parentheses problem solution in C
- Leetcode Valid Parentheses problem solution in Java
- Leetcode Valid Parentheses problem solution in Python
- Leetcode Valid Parentheses problem solution in C#