/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

14 votes195 views6 answers
Fibonacci
Java
0 vote198 views1 answer
Android studio change image on button click
Java
0 vote192 views3 answers
Java random 6 digit number
Java
0 vote148 views1 answer
One space diagonally in java
Java
4 votes185 views6 answers
Java while loop
Java
2 votes181 views2 answers
Error: Could not find or load main class PC
Java
0 vote229 views1 answer
Number output swing java
Java
-1 vote200 views1 answer
Why is java so verbose
Java
2 votes253 views1 answer
Cannot lock java compile cache as it has already been locked by this process
Java
0 vote198 views1 answer
Getresources in adapter android
Java