-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathparanthesis_checker.java
53 lines (49 loc) · 1.21 KB
/
paranthesis_checker.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
package dynamic_programming;
import java.util.Stack;
public class paranthesis_checker {
public static void main(String[] args) {
String str = "({{}}[])";
boolean flag=true;
Stack<Character> s= new Stack<Character>();
char c;
for(int i=0;i<str.length();i++)
{
c= str.charAt(i);
if(c=='(' || c=='{' || c=='[')
s.push(c);
else {
if(c== ')')
{
if(s.peek()=='(')
s.pop();
else{
flag=false;
break;
}
}
if(c== '}')
{
if(s.peek()=='{')
s.pop();
else{
flag=false;
break;
}
}
if(c== ']')
{
if(s.peek()=='[')
s.pop();
else{
flag=false;
break;
}
}
}
}
if(flag==false)
System.out.println("not balanced");
else
System.out.println("balanced");
}
}