题目:https://leetcode.cn/problems/valid-parentheses/
解法:
1.栈 时间:o(n) 空间:o(n)
class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<>();
for(int i = 0; i < s.length(); i++){
char c = s.charAt(i);
if(c == ')' && !stack.isEmpty()){
if(stack.peek() != '(') return false;
stack.pop();
}else if(c == ']' && !stack.isEmpty()){
if(stack.peek() != '[') return false;
stack.pop();
}else if(c == '}' && !stack.isEmpty()){
if(stack.peek() != '{') return false;
stack.pop();
}else{
stack.push(c);
}
}
if(stack.isEmpty()) return true;
return false;
}
}