-
Notifications
You must be signed in to change notification settings - Fork 64
/
Copy pathSolution.java
55 lines (48 loc) · 1.38 KB
/
Solution.java
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
//solution 1
class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<Character>();
for(char c: s.toCharArray()){
if(c == '(') {
stack.push(')');
} else if(c == '[') {
stack.push(']');
} else if(c == '{') {
stack.push('}');
} else if(stack.isEmpty() || stack.pop() != c){
return false;
}
}
return stack.isEmpty();
}
}
//solution 2
class Solution {
public boolean isValid(String s) {
char[] arr = s.toCharArray();
Stack<Character> stack = new Stack<>();
for(char cur : arr)
{
if(cur == '(' || cur == '[' || cur == '{')
{
stack.add(cur);
}
else
{
if(stack.isEmpty()) return false;
if(stack.peek() == '(' && cur != ')') return false;
if(stack.peek() == '{' && cur != '}') return false;
if(stack.peek() == '[' && cur != ']') return false;
stack.pop();
}
}
return stack.isEmpty();
}
}
/**
()[}
stack = ['[']
1. closing paranthese must match with the most recent open parentheses
2. we care about the most recent left parantheses
3. what if we have extra closing parantheses
*/