-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStacks.java
33 lines (32 loc) · 1.01 KB
/
Stacks.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
import java.util.Stack;
public class Stacks {
public static void main(String[] args) {
String s = "([[()]]{}[()])";
Stack<Character> stack = new Stack<>();
boolean valid = true;
for(int i = 0; i < s.length(); i++){
char c = s.charAt(i);
if(c == '(' || c == '[' || c == '{')
stack.push(c);
else{
if(stack.isEmpty()){
valid = false;
break;
}
char lastOpen = stack.pop();
if(lastOpen == '(' && c != ')'){
valid = false;
break;
}else if(lastOpen == '[' && c != ']'){
valid = false;
break;
}else if(lastOpen == '{' && c != '}'){
valid = false;
break;
}
}
}
if(!stack.isEmpty()) valid = false;
System.out.println(s+ " is valid: " + valid);
}
}