-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path20_valid_parentheses.java
More file actions
63 lines (45 loc) · 1.23 KB
/
20_valid_parentheses.java
File metadata and controls
63 lines (45 loc) · 1.23 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
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
*/
class Solution {
public boolean isValid(String s) {
if (s == null) {
return true;
}
Stack<Character> stack = new Stack<Character>();
Map<Character, Character> map = new HashMap<Character, Character>();
map.put(')', '(');
map.put('}', '{');
map.put(']', '[');
for (int i = 0;i < s.length();i ++) {
char c = s.charAt(i);
if (! map.containsKey(c)) {
stack.push(c);
} else {
if (stack.isEmpty() || stack.pop() != map.get(c)) {
return false;
}
}
}
return stack.isEmpty();
}
}