Balanced parentheses

#include <iostream>
//This program works only for parantheses "()".
//Check more to get the program of balanced brackets.
using namespace std;

int is_balanced(char input[])
{
    char s[100];
    char last;
    int top = 0;
    
    
    for(int i = 0; input[i] != '\0'; i++)
    {
        if(input[i] == '(')
        {
            s[top] = '(';
            top++;
        }else if(input[i] == ')')
        {
            if(top == 0)
            {
                return 0;
            }
            
            top--;
            if(s[top] == ')')
            {
                return 0;
            }
        }
    }
    
    if(top == 0)
    {
        return 1;
    }else
    {
        return 0;
    }
    
}

int main()
{
    char input[100];
    cin >> input;
    if(is_balanced(input))
    {
        cout << "Balanced!\n";
    }else
    {
        cout << "Imbalanced!\n";
    }
    return 0;
}

Algorithm check balanced parentheses

if (null == str || ((str.length() % 2) != 0)) {
    return false;
} else {
    char[] ch = str.toCharArray();
    for (char c : ch) {
        if (!(c == '{' || c == '[' || c == '(' || c == '}' || c == ']' || c == ')')) {
            return false;
        }
    }
}

-1

Source: baeldung.com

Similar codes

0 vote327 views1 answer
Is variable sized array are not allowed in c++?
C++
0 vote334 views1 answer
C language all keywords in string
C++
0 vote323 views1 answer
Mkdir c++
C++
26 votes341 views2 answers
Remove element from vector on condition c++
C++
0 vote335 views1 answer
Print hola mundo
C++
38 votes421 views6 answers
How to print hello world in c++
C++
0 vote363 views1 answer
Find maximum sum of circular subarray
C++
0 vote310 views1 answer
Void linux java
C++
0 vote339 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
4 votes375 views2 answers
Gcd function c++
C++