FilesExpand file tree

 master

/

A005BalancedParanthesisUsingStack.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

36 lines (33 loc) · 1.29 KB

 master

/

A005BalancedParanthesisUsingStack.java

Top

File metadata and controls

• Code
• Blame

36 lines (33 loc) · 1.29 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

public class A005BalancedParanthesisUsingStack {

private LinkList stack = new LinkList();

//java A005BalancedParanthesisUsingStack "[(a) + b ]" prints true

//java A005BalancedParanthesisUsingStack "[(a) + b }]" prints false

public static void main(String[] args) {

String expression = args[0];

A005BalancedParanthesisUsingStack ob = new A005BalancedParanthesisUsingStack();

System.out.println("expression: "+expression+" is Balanced? "+ob.isBalanced(expression));

}

public boolean isBalanced(String expression){

for (char ch : expression.toCharArray()) {

if(ch == '(' || ch == '[' || ch == '{'){

stack.push(ch);

}else if(ch == ')'){

char poped = (char) stack.pop();

if(poped != '('){

return false;

}

}else if(ch == ']'){

char poped = (char) stack.pop();

if(poped != '['){

return false;

}

}else if(ch == '}'){

char poped = (char) stack.pop();

if(poped != '{'){

return false;

}

}

}

return stack.isEmpty() ;

}

}