题目:
https://leetcode-cn.com/problems/valid-parentheses/submissions/
答案:
利用数据结构栈的特性
public boolean isValid(String s) {
if (s.length() % 2 == 1) {
return false;
}
Map<Character, Character> hashMap = new HashMap<Character, Character>() {{
put(')', '(');
put(']', '[');
put('}', '{');
}};
Deque<Character> stack = new LinkedList<>();
for (int i = 0; i < s.length(); i++) {
char ch = s.charAt(i);
if (hashMap.containsKey(ch)) {
if (stack.isEmpty() || stack.peek() != hashMap.get(ch)) {
return false;
}
stack.pop();
} else {
stack.push(ch);
}
}
return stack.isEmpty();
}