- Java Basic Programs
- Java Programming Examples
- Java Print Hello World
- Java Get Input from User
- Java Print Integer
- Java Add two Numbers
- Java Check Even or Odd
- Java Check Prime or Not
- Java Check Alphabet or Not
- Java Check Vowel or Not
- Check Reverse equal Original
- Java Fahrenheit to Celsius
- Java Celsius to Fahrenheit
- Java Perfect Number Program
- Java Find Quotient Remainder
- Java Days to Seconds
- Java Count Digits in Number
- Java Binary Number Addition
- Java Discount Program
- Java Compute Courier Charge
- Java Find Telephone Bill
- Java Print ASCII Values
- Java Check Palindrome or Not
- Java Check Armstrong or Not
- Generate Armstrong Numbers
- Add two Numbers using Pointers
- Java Mathematical Programs
- Add Subtract Multiply & Divide
- Java Make Calculator
- Java Add Digits of Number
- Java Check Leap Year or Not
- Java Check Divisibility
- Java Find Simple Interest
- Java Find Compound Interest
- Java Print Fibonacci Series
- Java Find nCr nPr
- Calculate Average & Percentage
- Java Calculate Arithmetic Mean
- Java Calculate Student Grade
- Java Print Table of Number
- Java Print Prime Numbers
- Java Add n Numbers
- Java Interchange two Numbers
- Java Reverse Numbers
- Java Swap two Numbers
- Count Positive Negative & Zero
- Find Largest of two Numbers
- Find Largest of three Numbers
- Java Find Factorial of Number
- Java Find HCF & LCM
- Area & Perimeter of Square
- Area & Perimeter of Rectangle
- Area & Circumference of Circle
- Java Conversion Programs
- Java Decimal to Binary
- Java Decimal to Octal
- Java Decimal to Hexadecimal
- Java Binary to Decimal
- Java Binary to Octal
- Java Binary to Hexadecimal
- Java Octal to Decimal
- Java Octal to Binary
- Java Octal to Hexadecimal
- Java Hexadecimal to Decimal
- Java Hexadecimal to Binary
- Java Hexadecimal to Octal
- Java Pattern Programs
- Java Pattern of Stars
- Java Pattern of Alphabets
- Java Pattern of Numbers
- Java Pyramid of Stars
- Java Pyramid of Alphabets
- Java Pyramid of Numbers
- Java Print Diamond Pattern
- Java Print Floyd Triangle
- Java Print Pascal Triangle
- Java Array Programs
- One Dimensional Array Program
- Java Linear Search
- Java Binary Search
- Find Largest Element in Array
- Find Smallest Element in Array
- Java Reverse Array
- Insert Element in Array
- Delete Element from Array
- Java Merge two Array
- Java Bubble Sort
- Java Selection Sort
- Java Insertion Sort
- Java Find Common Elements
- Java Count Even/Odd Number
- Two Dimensional Array Program
- Java Add two Matrices
- Java Subtract two Matrices
- Java Transpose Matrix
- Multiply two Matrices
- Three Dimension Array Program
- Java String Programs
- Java Print String
- Find Length of String
- Java Compare two String
- Java Copy String
- Java Concatenate String
- Java Reverse String
- Delete Vowels from String
- Delete Words from Sentence
- Find Occurrence of a Character
- Java Find Occurrence of a Word
- Occurrence of Each Character
- Java Occurrence of Each Word
- Java Count Repeated Characters
- Java Count Repeated Words
- Java Capitalize Each Word
- Java Count Vowels/Consonants
- Java Extract Numbers
- Java Count Word in String
- Remove Spaces from String
- Java Sort a String
- Java Uppercase to Lowercase
- Java Lowercase to Uppercase
- Java Swap two Strings
- Java Check Anagram or Not
- Java Check Balance Parentheses
- Java Check Password Strength
- Java File Programs
- Java Read File
- Java Write to File
- Read & Display File Content
- Java Copy File
- Java Append Text to File
- Java Merge two File
- List files in Directory
- Java Delete File
- Java Miscellaneous Programs
- Generate Random Numbers
- Java Print Time & Date
- Java Get IP Address
- Java Shutdown Computer
- Java Programming Tutorial
- Java Tutorial
Java Program to Check Balanced Parentheses
This article contains a program in Java to check whether the expression has balanced parentheses or not. That is, the program helps in checking whether brackets used in an expression such as (, ), {, }, [, ] are in balance or not.
The expression will be in balanced parentheses, if there is an opening (, {, or [, then there must be a closing ), }, or ]. The program is created with and without using stack.
Check Balanced Parentheses without using Stack
The question is, write a Java program to check balanced parentheses. The program must be created without using stack. And the string must be received by user at run-time. The program given below is the answer to this question:
import java.util.Scanner; public class CodesCracker { public static void main(String[] args) { String expression; int i, length, j=0, count=0; char ch, c; char[] stk = new char[20]; Scanner s = new Scanner(System.in); System.out.print("Enter the Expression: "); expression = s.nextLine(); length = expression.length(); for(i=0; i<length; i++) { ch = expression.charAt(i); if(ch=='(' || ch=='{' || ch=='[') { stk[j] = ch; j++; count = 1; } else if(ch==')') { if(count==1) j--; c = stk[j]; if(stk.length==0 || c != '(') { System.out.println("\nUnbalanced Parentheses!"); return; } } else if(ch=='}') { if(count==1) j--; c = stk[j]; if(stk.length==0 || c != '{') { System.out.println("\nUnbalanced Parentheses!"); return; } } else if(ch==']') { if(count==1) j--; c = stk[j]; if(stk.length==0 || c != '[') { System.out.println("\nUnbalanced Parentheses!"); return; } } } System.out.println("\nBalanced Parentheses."); } }
Here is its sample run with user input {2+(4*2)-(3+5)}:
Here is another sample run with user input [x+{y+3-(2*z)+34] as expression to check whether parentheses are balanced or not:
Check Balanced Parentheses using Stack
The program given below does the same job as of previous program. The only difference is its approach, as this program is created using stack.
import java.util.*; public class CodesCracker { public static void main(String[] args) { String expression; int i, length; char ch; Scanner s = new Scanner(System.in); System.out.print("Enter the Expression: "); expression = s.nextLine(); Stack<Character> stack = new Stack<Character>(); length = expression.length(); for(i=0; i<length; i++) { ch = expression.charAt(i); if(ch=='(' || ch=='{' || ch=='[') { stack.push(ch); } else if(ch==')') { if(stack.isEmpty() || stack.pop() != '(') { System.out.println("\nUnbalanced Parentheses!"); return; } } else if(ch=='}') { if(stack.isEmpty() || stack.pop() != '{') { System.out.println("\nUnbalanced Parentheses!"); return; } } else if(ch==']') { if(stack.isEmpty() || stack.pop() != '[') { System.out.println("\nUnbalanced Parentheses!"); return; } } } if(stack.isEmpty()) System.out.println("\nBalanced Parentheses."); } }
This program produces same output as of previous program. In above program, the code:
stack.isEmpty()
is used to check whether the stack is empty or not. In previous program, I've done the same using following code:
stk.length==0
where stk is character array, used to store parentheses.
The code stack.push() is used to push or insert an element at top of the stack, whereas the code stack.pop() is used to remove the top element from the stack.
« Previous Program Next Program »