-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathValidParentheses.java
More file actions
66 lines (59 loc) · 1.96 KB
/
Copy pathValidParentheses.java
File metadata and controls
66 lines (59 loc) · 1.96 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
64
65
66
import java.util.HashMap;
import java.util.Stack;
class ValidParentheses {
// My Solution - doesn't work for "({{{{}}}))"
public boolean myIsValid(String s) {
if (s == null || s.length() == 1)
return false;
Stack<Character> chars = new Stack<>();
char[] charArray = s.toCharArray();
int i = 0;
for (i = 0; i < charArray.length; i++) {
if (charArray[i] == '(' || charArray[i] == '{' || charArray[i] == '[') {
chars.push(charArray[i]);
}
else {
if (chars.isEmpty()) {
return false;
}
char previous = charArray[i-1];
switch (previous) {
case '[':
if (charArray[i] != ']')
return false;
else break;
case '(':
if (charArray[i] != ')')
return false;
else break;
case '{':
if (charArray[i] != '}')
return false;
else break;
default:
break;
}
chars.pop();
}
}
return (chars.isEmpty());
}
public boolean isValid(String s) {
char[] chars = s.toCharArray();
Stack<Character> charStack = new Stack<>();
HashMap<Character, Character> map = new HashMap<>();
map.put(')', '(');
map.put(']', '[');
map.put('}', '{');
for (Character c : chars) {
if (map.containsKey(c) && !charStack.isEmpty()) {
if (map.get(c) == charStack.peek()) {
charStack.pop();
}
else return false;
}
else charStack.push(c);
}
return charStack.isEmpty();
}
}