Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    Balanced Paranthesis

    Uploaded by

    Yashika Aggarwal
    This C++ code defines a function to check if parentheses, brackets and braces are balanced in an expression. It uses a stack to keep track of opening symbols and pops them when the corresponding closing symbol is encountered, returning true if the stack is empty after parsing the whole expression.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Balanced Paranthesis

    Uploaded by

    Yashika Aggarwal
    9 views2 pages
    This C++ code defines a function to check if parentheses, brackets and braces are balanced in an expression. It uses a stack to keep track of opening symbols and pops them when the corresponding closing symbol is encountered, returning true if the stack is empty after parsing the whole expression.

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This C++ code defines a function to check if parentheses, brackets and braces are balanced in an expression. It uses a stack to keep track of opening symbols and pops them when the corresponding closing symbol is encountered, returning true if the stack is empty after parsing the whole expression.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    9 views2 pages

    Balanced Paranthesis

    Uploaded by

    Yashika Aggarwal
    This C++ code defines a function to check if parentheses, brackets and braces are balanced in an expression. It uses a stack to keep track of opening symbols and pops them when the corresponding closing symbol is encountered, returning true if the stack is empty after parsing the whole expression.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    of 2

    #include <iostream>

    #include<stack>
    using namespace std;

    int length(char *exp){


    int length=0;
    for(int i=0;exp[i]!='\0';i++)
    length++;
    return length;
    }

    bool checkBalanced(char *exp){


    stack<int> st;
    int l =length(exp);
    for(int i = 0 ; i < l ; i++){

    if(exp[i]=='('||exp[i]=='{'||exp[i]=='['){
    st.push(exp[i]);
    continue;
    }

    else if(exp[i]==')'){
    if(st.empty() == false){
    if(st.top()=='(')
    st.pop();
    }
    else
    return false;
    }

    else if(exp[i]=='}'){
    if(st.empty() == false){
    if(st.top()=='{')
    st.pop();
    }
    else
    return false;
    }
    else if(exp[i]==']'){
    if(st.empty() == false){
    if(st.top()=='[')
    st.pop();
    }
    else
    return false;
    }

    if(st.empty()==true){
    return true;
    }
    else
    return false;
    }
    int main() {
    char input[100000];
    cin.getline(input, 100000);
    if(checkBalanced(input)) {
    cout << "true" << endl;
    }
    else {
    cout << "false" << endl;
    }
    }

    You might also like