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

valid parentheses leetcode solution java

Add Answer

Purple Team answered on February 11, 2022 Popularity 10/10 Helpfulness 1/10

answer valid parentheses leetcode solution java

related valid parentheses leetcode

valid parentheses leetcode solution java

Comment

-1

HashMap<Character, Character> map = new HashMap<Character, Character>();
	map.put('(', ')');
	map.put('[', ']');
	map.put('{', '}');
 
	Stack<Character> stack = new Stack<Character>();
 
	for (int i = 0; i < s.length(); i++) {
		char curr = s.charAt(i);
 
		if (map.keySet().contains(curr)) {
			stack.push(curr);
		} else if (map.values().contains(curr)) {
			if (!stack.empty() && map.get(stack.peek()) == curr) {
				stack.pop();
			} else {
				return false;
			}
		}
	}
 
	return stack.empty();

Popularity 10/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java parentheses solution

Link to this answer
Share Copy Link

Contributed on Feb 11 2022

Purple Team

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 solution java

Contents

More Related Answers

valid parentheses leetcode solution java

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.