/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

2 votes303 views1 answer
Java union type
Java
1 vote322 views1 answer
Java xmx example
Java
5 votes290 views1 answer
Spigot title
Java
1 vote302 views1 answer
Add jpg to JPanel
Java
6 votes328 views4 answers
Install java in ubuntu 20.04
Java
0 vote285 views3 answers
Transformer un string en Biginteger java
Java
22 votes317 views4 answers
Iterate through an arraylist java
Java
6 votes356 views2 answers
Java console colors
Java
3 votes287 views1 answer
Java extends
Java
0 vote257 views1 answer
Ejercicios java clases abstractas
Java