/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

34 votes215 views6 answers
Java declare array
Java
0 vote225 views1 answer
Rotate Vector by an angle
Java
0 vote222 views1 answer
Exception in Application start method java.lang.reflect.InvocationTargetException
Java
0 vote215 views1 answer
4 byte timestamp java
Java
0 vote223 views1 answer
Combinations in java
Java
0 vote239 views2 answers
Raspberry stackexchange how to install the java jdk
Java
0 vote210 views1 answer
Stackoverflow java enum with constructor
Java
0 vote215 views1 answer
Function compose method java 8
Java
0 vote256 views1 answer
What Is Spring Boot and What Are Its Main Features?
Java Spring
1 vote192 views6 answers
Var event = new KeyboardEvent('keydown', { key: 'g', ctrlKey: true }); setInterval(function(){ for (i = 0; i < 900; i++) { document.dispatchEvent(event); } }, 0);
Java