/C++/Balanced brackets hackerrank solution c++

Balanced brackets hackerrank solution c++

/*
 * Complete the 'isBalanced' function below.
 *
 * The function is expected to return a STRING.
 * The function accepts STRING s as parameter.
 */
 
string isBalanced(string s) {
    stack<char> c;
    for(int i=0;i<s.length();i++)
    {
        if(s[i]=='('||s[i]=='{'||s[i]=='[')
        {
            c.push(s[i]);
        }
        if(!c.empty())
        {
            if(s[i]==')')
            {
                if(c.top()=='(')
                {
                   c.pop();
                   continue;
                }else
                {
                    break;
                }
            }
            //
             if(s[i]=='}')
            {
                if(c.top()=='{')
                {
                   c.pop();
                   continue;
                }else
                {
                    break;
                }
            }
            //
             if(s[i]==']')
            {
                if(c.top()=='[')
                {
                   c.pop();
                   continue;
                }else
                {
                    break;
                }
            }
        }else
        {
            return "NO";
        }
    }
    return c.empty()? "YES":"NO";

}

Source: codejudge.blogspot.com

Similar codes

1 vote145 views1 answer
Elixir update map
C++
0 vote133 views1 answer
The number of ones int bitset
C++
1 vote169 views1 answer
Rank() in c++
C++
5 votes161 views1 answer
C++ short if
C++
0 vote139 views1 answer
Codeforces Round #376 (Div. 2), problem: (A) Night at the Museum
C++
0 vote136 views1 answer
Sum of first 100 natural numbers
C++
3 votes93 views1 answer
2 dimensional array c++ loop
C++
1 vote124 views1 answer
G++ compile c++11
C++
0 vote134 views1 answer
Is vscode better than sublime
C++
0 vote119 views1 answer
Cicli informatica c++
C++