Breaking News: Grepper is joining You.com. Read the official announcement!

Valid Parentheses leetcode in c++

Add Answer

coder answered on February 20, 2022 Popularity 10/10 Helpfulness 1/10

answer Valid Parentheses leetcode in c++

related valid parentheses leetcode

Valid Parentheses leetcode in c++

Comment

-2

#include<iostream>
#include<stack>
using namespace std;
bool isValid(string s) {
	stack<char> st;
	for (int i = 0; i < s.length(); i++)
	{
		if (s[i] == '(' || s[i] == '{' || s[i] == '[')
			st.push(s[i]);
		if (!st.empty())
		{
			if (s[i] == ')')
			{
				if (st.top() == '(')
				{
					st.pop();
					continue;
				}
				else
					break;
			}
			//
			if (s[i] == '}')
			{
				if (st.top() == '{')
				{
					st.pop();
					continue;
				}
				else
					break;
			}
			//
			if (s[i] == ']')
			{
				if (st.top() == '[')
				{
					st.pop();
					continue;
				}
				else
					break;
			}
		}
		else
			return false;
	}
	return st.empty() ? true : false;
}
int main()
{
	string s;
	cin >> s;
	cout << isValid(s) << "\n";
	return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: codejudge.blogspot.com

Tags: c++ parentheses stack structure

Link to this answer
Share Copy Link

Contributed on Feb 20 2022

coder

0 Answers Avg Quality 2/10

Closely Related Answers

valid parentheses leetcode

Comment

-1

class Solution {
public:
    bool isValid(string s) {
        stack<char>st;
        if(s.length()==1)
        return false;
    for (int i = 0; i < s.length(); i++)
    {
        if (s[i] == '(' || s[i] == '[' || s[i] == '{')
        {
            st.push(s[i]);
        }
        else if (s[i] == ')')
        {
            if (!st.empty() && st.top() == '('  )
            {
                st.pop();
            }
            else
            {
                return false;
            }
        }
        else if (s[i] == '}')
        {
            if (!st.empty() && st.top() == '{')
            {
                st.pop();
            }
            else
            {
                return false;
            }
        }
        else if (s[i] == ']')
        {
            if ( !st.empty() && st.top() == '[' )
            {
                st.pop();
            }
            else
            {
                return false;
            }
        }
    }
    if (st.empty())
        return true;
    else
        return false;
    }
};

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: parentheses pare

Link to this answer
Share Copy Link

Contributed on Sep 11 2023

Muhammad Rayyan

0 Answers Avg Quality 2/10

Valid Parentheses leetcode in c++

Contents

More Related Answers

Valid Parentheses leetcode in c++

Closely Related Answers

valid parentheses leetcode

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.