Question

Given a string that consists of only two types of characters “(“ and “)”. Balance the parentheses by inserting either a “(“ or a “)” as many times as necessary. Determine the minimum number of characters that must be inserted.

Answer 1

public class BalancetheParantheses
{
  
   public static void main(String args[])
   {
   String str = " ";
   Stack<Character> s= new Stack(); // created stack s for --> ( <-- character
   Stack<Character> s1=new Stack(); // created stack s1 for --> ) <-- character
   // Creating array of string length
   char[] ch = new char[str.length()];
   char[] ch1=new char[str.length()];
   int count=0;
   int count1=0;
   int m=0;
   int m1=0;
   if(str==null|str.isEmpty())
   {System.out.println("Empty please fill the value "); }
   else {
   for (int i = 0; i < str.length(); i++)
   {
   if(str.charAt(i)=='(')
   {
       s.push(str.charAt(i));
       count++;
         
   }
   else if(str.charAt(i)==')')
   {
       s1.push(str.charAt(i));
       count1++;
   }
  
     
   }
  
  
   if(count==count1)
   {
       System.out.print("Your String is Balanced \n");
   }
  
   else {
      
  
   if(count>count1)
   {
       while(count>count1)
       {
           s1.push(')');
           count1++;
           m++;
       }
   }
   else if (count1>count)
   {
       s.push('(');
       count++;
       m++;
   }
  
   }
     
   System.out.println("Minimum Number of Characters must Inserted :" +m);
   System.out.println("The Resultant String : \n"+ s.toString()+s1.toString());
     
  
   }
   }
   }