Skip to main content

Balanced brackets in C++

It was a question on coursera course in Data structure and I spent some time on the program. Though I had taught the program to students earlier.

But somehow coursera is not accepting my submission:( So why not blog it?

The question is Write a program to balance brackets using stack. This is fundamental requirement in any programming language.

Let us look at some valid and invalid  strings.

{[]}()   valid
[]{}()[] valid
{([([])])} valid

{}) invalid
([)] invalid
({[]} invalid

You are getting the gist, right? When ever there is an opening bracket, there should be a corresponding closing bracket of matching type. And order is important, you can not have round bracket , square bracket followed by closing round bracket first and square bracket next.

So the algorithm is very simple
  1. create a stack of characters
  2. repeat for each i from 0 to length of string
    1. ch = ith character
    2. if ch is either { or [ or (, push it to stack
    3. if ch is closing bracket i.e. } or ] or } 
      1. get stack top charcter ch2
      2. if ch and ch2 are of same type pop the  char
      3. if not return a false
  3. if stack is empty all opening brackets are popped. Return true
  4. if stack is not empty, there are some extra opening brackets. Return false

Now for the code. I used the stack from stl in c++. Here is the code.


#include<stack>
#include<iostream>
using namespace std;
bool isBalanced(string str,char &wrongChar);
int main()
{
    
    string str;
    cout<<"Enter your string";
     getline(cin,str,'\n');
    char ch;
    bool bal = isBalanced(str,ch);
    if(bal)
      cout<<"success";
    else
      cout<<ch;
}

bool isBalanced(string str,char &wrongChar)
{
    stack<char> brackStack;
    int len = str.length();
    for(int i=0;i<len;i++)
        {
           char ch= str[i];
           if(ch=='(' || ch=='[' || ch=='{')
              brackStack.push(ch);
           else if ( ch==')' || ch==']' || ch=='}')
              {
                  char topChar = brackStack.top();
                  if(  (ch==')' && topChar=='(') ||
   (ch==']' && topChar=='[') ||
   (ch=='}' && topChar=='{') )
                   {
                      brackStack.pop();
                      continue;
                   }
                   else{
            /* not matching*/
            wrongChar = ch;
            return false;
     }
               }
         }
      if(brackStack.empty())
         return true;
      else
         {
           wrongChar = brackStack.top();
           return false;
          }
}

Not so tough? Isn't  it?

For more such questions and notes on all advanced topics, download my app c++ notes
Labels:

Comments

Post a Comment

Popular posts from this blog

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more

Program to create a Linked List in C

An array is a commonly used data structure in most of the languages. Because it is simple, it needs O(1) time for accessing elements. It is also compact. But an array has a serious drawback - it can not grow or shrink. You need to estimate the array size and define it during compile time. This drawback is not present a linked list. A linked list is a data structure which can grow or shrink dynamically.  A linked list has nodes each of which contain  contain  data and a link to next node . These nodes are dynamically allocated structures. If you need more nodes, you just need to allocate memory for these and link these nodes to the existing list. The nodes of a linked list have to be defined as self-referential structures in C. That is structures with data members and one member which is a pointer to the structure of same type.  This pointer will work as a link to next node. struct node { int data; struct node * next; //pointer to another node }...
1 comment
Read more

Function to add a node to binary search tree

Binary search tree (BST) is an ordered tree where each node has smaller values on the left sub tree and larger values on the right subtree. This is similar to binary search algorithm. And another useful fact is if you traverse the node in in-order method, the values of the tree will be in ascending order. Binary Search Tree with root as 50 Now as you can see from the diagram on the left child and their children of root (which in this case is 50), values are 40, 20 and 45. All are less than 50. On the other hand, on the right sub tree 50, the values are 60, 55 and 78 - larger than 50. And this rule follows for each and every node, not just root. Now if we have to  add a node - let us 43, where shall we add it, in such a way that the tree will still remain as BST. The new node must be a leaf node (i.e. the node with no child nodes) Let us traverse from root and find out where this new node fits. 43 is smaller than 50. Hence we must branch to left of 50. Now we get 40. 4...
Post a Comment
Read more