Valid Parentheses
Description
Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.
An input string is valid if:
1.Open brackets must be closed by the same type of brackets.
2.Open brackets must be closed in the correct order.
Note that an empty string is also considered valid.
- Example 1
Input: “()”
Output: true
- Example 2
Input: “()[]{}”
Output: true
- Example 3
Input: “(]”
Output: false
- Example 4
Input: “([)]”
Output: false
- Example 5
Input: “{[]}”
Output: true
Solution
分析例子的特点:
(1)都是成对出现的,所以有一个一一对应的关系,可以考虑使用哈希表(键和值的对应关系);
(2)一对键和值可以把另一对键和值包含进去,也可以在之后再有一对键和值,所以就要先行存起来,待需要的时候取出,可以考虑使用栈(先入后出)。
map和stack用来存正确的对应关系,遍历的过程用来进行校验。
public boolean isValid(String s) {
char[] chars = s.toCharArray();//转换为字符串数组
Map<Character,Character> map = new HashMap<Character,Character>();//Map的键和值都是字符
map.put('(', ')');
map.put('{', '}');
map.put('[', ']');
Stack<Character> stack = new Stack<Character>();//栈里面也是Character
for (char c:chars) {
if (map.containsKey(c)) {
stack.push(pairs.get(c));
} else {
if (stack.isEmpty() || c != stack.pop()) return false;
}
}
return stack.isEmpty();
}
Appendix
1.map的几个方法Java map接口