-
Notifications
You must be signed in to change notification settings - Fork 0
/
JavaStack.java
48 lines (43 loc) · 1.38 KB
/
JavaStack.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
package DataStructure;
import java.util.*;
class JavaStack {
public static void main(String[] argh) {
Scanner sc = new Scanner(System.in);
Stack<Character> stack;
String input;
char c;
boolean result = true;
while (sc.hasNext()) {
input = sc.next();
result = true;
stack = new Stack<>();
for (int x = 0, l = input.length(); x < l; x++) {
c = input.charAt(x);
if (c == ')') {
if (stack.isEmpty() || stack.pop() != '(') {
result = false;
break;
}
} else if (c == ']') {
if (stack.isEmpty() || stack.pop() != '[') {
result = false;
break;
}
} else if (c == '}') {
if (stack.isEmpty() || stack.pop() != '{') {
result = false;
break;
}
} else {
stack.push(c);
}
}
//System.out.println(result + " " + stack.isEmpty());
if (result && stack.isEmpty()) {
System.out.println("true");
} else {
System.out.println("false");
}
}
}
}