forked from shivanshjaitly/Hackerrank-java-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathjava Stack.java
41 lines (38 loc) · 1.32 KB
/
java Stack.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
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static boolean isBalanced(String s) {
Stack<Character> stack = new Stack<Character>();
for (int i=0; i<s.length();++i){
if (s.charAt(i) == '(') stack.push('(');
else if (s.charAt(i) == '{') stack.push('{');
else if (s.charAt(i) == '[') stack.push('[');
else if (s.charAt(i) == ')') {
if (stack.isEmpty()) return false;
if (stack.pop() != '(') return false;
}
else if (s.charAt(i) == '}') {
if (stack.isEmpty()) return false;
if (stack.pop() != '{') return false;
}
else if (s.charAt(i) == ']') {
if (stack.isEmpty()) return false;
if (stack.pop() != '[') return false;
}
}
return stack.isEmpty();
}
public static void main(String[] args) {
Stack<Character> stack = new Stack<Character>();
Scanner sc = new Scanner(System.in);
String line;
while (sc.hasNextLine()){
line = sc.nextLine();
if (isBalanced(line)) System.out.println("true");
else System.out.println("false");
}
}
}