| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/feixiangcode/algorithm/master/Week_01/id_21/LeetCode_020_021.cpp | [Back] [Original] |
class Solution {
public:
bool isValid(string s) {
stack temp;
for (int i = 0; i < s.size(); i++) {
if (s.size() > 0 && isPair(temp.top(), s[i])) {
temp.pop();
} else {
temp.push(s[i]);
}
}
return temp.size() == 0;
}
private:
bool isPair(char left, char right) {
if (left == '(' && right == ')') return true;
if (left == '[' && right == ']') return true;
if (left == '{' && right == '}') return true;
return false;
}
};
| Web Proxy Viewer | New URL | Original Page |