/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 vote382 views1 answer
Java initialize dynamic array of boolean
Java
107 votes532 views6 answers
Java switch
Java
0 vote337 views1 answer
Sudo visudo quit without saving
Java
0 vote369 views1 answer
Get bimap by uri in android
Java
0 vote347 views1 answer
DMC5 performace mod
Java
1 vote351 views2 answers
Set icon to fab programmatically in android studio
Java
0 vote353 views1 answer
Crazy error
Java
0 vote392 views1 answer
V2ray
Java
0 vote361 views1 answer
Java pause program until key pressed
Java
18 votes356 views6 answers
Java for
Java