/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 vote271 views1 answer
How to open material navigation view on button click
Java
0 vote267 views1 answer
Java make a method that connects two strings
Java
0 vote252 views3 answers
Treeset in java
Java
1 vote285 views1 answer
Java double to fixed decimal
Java
3 votes271 views3 answers
Rgb to hex java
Java
0 vote261 views1 answer
Count occurrences in seven integers using java single dimension arrays
Java
0 vote330 views1 answer
Spring boot eureka , zual hystrix, rest api docs
Java Spring
1 vote258 views1 answer
Spring xml file configuration
Java
0 vote292 views1 answer
Java multiple implements
Java
0 vote268 views1 answer
Spring boot bean configuration
Java