/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

0 vote155 views1 answer
How to connect from Android emulator to application on localhost?
Java
0 vote115 views1 answer
Transformer une chaine de caractère en nombre java
Java
1 vote126 views3 answers
Recursion java
Java
1 vote132 views1 answer
Android java text fields
Java
1 vote128 views3 answers
Javafx textarea font size
Java
4 votes123 views2 answers
Java run cmd
Java
5 votes115 views1 answer
Ubuntu change default java path
Java
1 vote169 views1 answer
Libgdx move camera with touch
Java
0 vote152 views1 answer
Java konsoleneingabe
Java
0 vote111 views1 answer
Root tree java
Java