/Java/Valid parentheses leetcode solution java

Valid parentheses leetcode solution java

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();

Similar codes

9 votes360 views6 answers
Java remove duplicates
Java
3 votes395 views3 answers
Array methods in java
Java
0 vote414 views1 answer
Spring boot send username in email html template
Java
1 vote355 views1 answer
How to find the largest number in a 2d array java
Java
0 vote493 views1 answer
How to add classpath in spring boot
Java Spring
2 votes343 views2 answers
Format localdatetime
Java
0 vote349 views1 answer
For each loop string java
Java
1 vote366 views1 answer
How to resice image button src
Java
-2 votes366 views2 answers
No enclosing instance of type Foo is accessible. Must qualify the allocation with an enclosing instance of type Foo (e.g. x.new A() where x is an instance of Foo
Java
10 votes350 views3 answers
Java alert box
Java