https://leetcode-cn.com/problems/valid-parentheses/
class Solution {
public boolean isValid(String s) {
Deque<Character> l = new LinkedList<>();
char[] arr = s.toCharArray();
Set<Character> left = new HashSet<>();
Set<Character> right = new HashSet<>();
left.add('(');
left.add('[');
left.add('{');
right.add(']');
right.add(')');
right.add('}');
for(int i = 0;i < s.length();i++) {
if(right.contains(arr[i])) {
//考虑左括号为空,出现了右括号,则直接返回false
if(l.size() == 0) return false;
if(arr[i] == ')' && l.pollLast() == '(') continue;
if(arr[i]