Question

Using recursion in java

Your program will check to see if braces are balanced.

For example {} is balanced { is not.

Your program will accept a string as such {}{{}{}{ and returns true or false if the braces are balanced

Ask the user to enter the brace combos.

Print balanced or unbalanced.

Answer 1

Program:

import java.util.Scanner;

public class CheckBalancedBraces {

//method to check to see if braces are balanced using recursion
   public static boolean isBalanced(String str)
   {
       int n = str.length();
      
       if(n==0)
           return true;
      
       if(n%2==1)
           return false;
                  
       if(str.charAt(0) == '{')
       {
           int i = str.indexOf('}');
           if(i==-1) return false;
           return isBalanced(str.substring(1,i)) && isBalanced(str.substring(i+1));
       }
       return false;
   }
  
   //main method
   public static void main (String[] args)
   {
         
       Scanner sc = new Scanner(System.in);
       System.out.print ("Enter the brace combos: ");
       s = sc.next();
boolean f = isBalanced(s);
       if(f)
           System.out.println ("Balanced");
       else
           System.out.println ("Not balanced");
}
}

Output:
Enter the brace combos: {{{}}
Not balanced