JAVA
① 堆(1ms)
import java.util.Deque;
import java.util.LinkedList;
class Solution {
public boolean isValid(String s) {
Deque<Character> stack = new LinkedList<>();
for (char c : s.toCharArray()) { // 将字符串转换为字符数组
if (c == '[') stack.push(']');
else if (c == '(') stack.push(')');
else if (c == '{') stack.push('}');
else if (stack.isEmpty() || c != stack.pop()) return false;
}
return stack.isEmpty();
}
}
向堆中插入右括号,取出时直接对比即可
② 堆 + 哈希映射(2ms)
import java.util.Deque;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
class Solution {
public boolean isValid(String s) {
int n = s.length();
if (n % 2 == 1) {
return false;
}
Map<Character,Character> pairs = new HashMap<Character,Character>();
pairs.put(')','(');
pairs.put(']','[');
pairs.put('}','{');
Deque<Character> stack = new LinkedList<Character>();
for (int i = 0; i < n; i++) {
char ch = s.charAt(i); // 返回指定索引处的字符
if (pairs.containsKey(ch)) { // 获取的是左边的元素
if (stack.isEmpty() || stack.peek() != pairs.get(ch)) {
return false;
}
stack.pop();
} else {
stack.push(ch);
}
}
return stack.isEmpty();
}
}
向堆中插入左括号,取出时还要进行映射对比
Python
① 堆(40ms)
class Solution:
def isValid(self, s: str) -> bool:
Stack = []
for i in range(len(s)):
if s[i] == '(':
Stack.append(')')
elif s[i] == '{':
Stack.append('}')
elif s[i] == '[':
Stack.append(']')
else:
if Stack == [] or Stack.pop() != s[i]:
return False
return Stack == []
② 堆 + 哈希映射(40ms)
class Solution:
def isValid(self, s: str) -> bool:
l_map = {'(': 0, '{': 1, '[': 2}
r_map = {')': 0, '}': 1, ']': 2}
Stack = []
for i in range(len(s)):
if s[i] in l_map:
Stack.append(s[i])
elif Stack == [] or l_map[Stack.pop()] != r_map[s[i]]:
return False
return Stack == []